./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-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 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:07:40,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:07:40,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:07:40,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:07:40,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:07:40,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:07:40,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:07:40,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:07:40,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:07:40,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:07:40,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:07:40,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:07:40,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:07:40,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:07:40,542 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:07:40,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:07:40,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:07:40,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:07:40,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:07:40,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:07:40,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:07:40,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:07:40,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:07:40,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:07:40,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:07:40,549 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:07:40,549 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:07:40,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:07:40,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:07:40,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:07:40,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:07:40,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:07:40,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:07:40,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:07:40,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:40,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:07:40,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:07:40,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:07:40,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:07:40,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:07:40,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:07:40,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:07:40,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:07:40,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:07:40,556 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 -> 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 [2024-10-14 20:07:40,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:07:40,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:07:40,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:07:40,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:07:40,858 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:07:40,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2024-10-14 20:07:42,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:07:42,583 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:07:42,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2024-10-14 20:07:42,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44403e9de/258317b9b653440ab4a4421cea3833bb/FLAGe5dea2b22 [2024-10-14 20:07:42,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44403e9de/258317b9b653440ab4a4421cea3833bb [2024-10-14 20:07:42,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:07:42,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:07:42,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:42,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:07:42,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:07:42,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:42" (1/1) ... [2024-10-14 20:07:42,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8d2505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:42, skipping insertion in model container [2024-10-14 20:07:42,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:42" (1/1) ... [2024-10-14 20:07:42,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:07:42,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:42,946 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:07:42,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:43,022 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:07:43,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43 WrapperNode [2024-10-14 20:07:43,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:43,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:43,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:07:43,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:07:43,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,073 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 212 [2024-10-14 20:07:43,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:43,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:07:43,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:07:43,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:07:43,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,106 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-10-14 20:07:43,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:07:43,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:07:43,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:07:43,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:07:43,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (1/1) ... [2024-10-14 20:07:43,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:43,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:43,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:07:43,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:07:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:07:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:07:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-14 20:07:43,231 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-14 20:07:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:07:43,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:07:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:07:43,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:07:43,328 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:07:43,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:07:43,800 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-10-14 20:07:43,800 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:07:43,840 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:07:43,840 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:07:43,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:43 BoogieIcfgContainer [2024-10-14 20:07:43,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:07:43,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:07:43,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:07:43,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:07:43,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:07:42" (1/3) ... [2024-10-14 20:07:43,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dde8727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:43, skipping insertion in model container [2024-10-14 20:07:43,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:43" (2/3) ... [2024-10-14 20:07:43,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dde8727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:43, skipping insertion in model container [2024-10-14 20:07:43,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:43" (3/3) ... [2024-10-14 20:07:43,849 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2.c.cil.c [2024-10-14 20:07:43,862 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:07:43,862 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-14 20:07:43,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:07:43,926 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;@30322921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:07:43,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-14 20:07:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 100 states have (on average 1.7) internal successors, (170), 124 states have internal predecessors, (170), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:07:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:07:43,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:43,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:43,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:43,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1116181924, now seen corresponding path program 1 times [2024-10-14 20:07:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:43,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743949094] [2024-10-14 20:07:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:44,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:44,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743949094] [2024-10-14 20:07:44,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743949094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:44,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:44,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:44,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42820696] [2024-10-14 20:07:44,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:44,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:44,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:44,209 INFO L87 Difference]: Start difference. First operand has 133 states, 100 states have (on average 1.7) internal successors, (170), 124 states have internal predecessors, (170), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 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.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 20:07:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:44,410 INFO L93 Difference]: Finished difference Result 317 states and 465 transitions. [2024-10-14 20:07:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:44,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-14 20:07:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:44,426 INFO L225 Difference]: With dead ends: 317 [2024-10-14 20:07:44,427 INFO L226 Difference]: Without dead ends: 158 [2024-10-14 20:07:44,432 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-10-14 20:07:44,436 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 87 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:44,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 463 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-14 20:07:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 147. [2024-10-14 20:07:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.4958677685950412) internal successors, (181), 138 states have internal predecessors, (181), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2024-10-14 20:07:44,487 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 8 [2024-10-14 20:07:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:44,488 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2024-10-14 20:07:44,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 20:07:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2024-10-14 20:07:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:07:44,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:44,490 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:44,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:07:44,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash -660542502, now seen corresponding path program 1 times [2024-10-14 20:07:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:44,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472388028] [2024-10-14 20:07:44,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:07:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472388028] [2024-10-14 20:07:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472388028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:44,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:44,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353460641] [2024-10-14 20:07:44,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:44,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:44,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:44,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,592 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10-14 20:07:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:44,666 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2024-10-14 20:07:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:44,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2024-10-14 20:07:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:44,668 INFO L225 Difference]: With dead ends: 147 [2024-10-14 20:07:44,669 INFO L226 Difference]: Without dead ends: 146 [2024-10-14 20:07:44,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,670 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:44,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 212 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-14 20:07:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-14 20:07:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 121 states have (on average 1.4793388429752066) internal successors, (179), 137 states have internal predecessors, (179), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2024-10-14 20:07:44,688 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 14 [2024-10-14 20:07:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:44,688 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2024-10-14 20:07:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10-14 20:07:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2024-10-14 20:07:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 20:07:44,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:44,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:44,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:07:44,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:44,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:44,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1870175012, now seen corresponding path program 1 times [2024-10-14 20:07:44,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:44,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570605069] [2024-10-14 20:07:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:44,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:44,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570605069] [2024-10-14 20:07:44,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570605069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:44,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:44,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:44,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064034425] [2024-10-14 20:07:44,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:44,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:44,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:44,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:44,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:44,751 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 3 states, 3 states have (on average 4.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-10-14 20:07:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:44,824 INFO L93 Difference]: Finished difference Result 274 states and 354 transitions. [2024-10-14 20:07:44,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:44,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.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 13 [2024-10-14 20:07:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:44,828 INFO L225 Difference]: With dead ends: 274 [2024-10-14 20:07:44,829 INFO L226 Difference]: Without dead ends: 158 [2024-10-14 20:07:44,830 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-10-14 20:07:44,831 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:44,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 215 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-14 20:07:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2024-10-14 20:07:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.464) internal successors, (183), 141 states have internal predecessors, (183), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2024-10-14 20:07:44,851 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 13 [2024-10-14 20:07:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:44,851 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2024-10-14 20:07:44,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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-10-14 20:07:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2024-10-14 20:07:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:07:44,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:44,852 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:44,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:07:44,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:44,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1026646331, now seen corresponding path program 1 times [2024-10-14 20:07:44,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686431188] [2024-10-14 20:07:44,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:44,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686431188] [2024-10-14 20:07:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686431188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601551613] [2024-10-14 20:07:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:44,935 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:07:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:45,066 INFO L93 Difference]: Finished difference Result 209 states and 270 transitions. [2024-10-14 20:07:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:45,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-14 20:07:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:45,070 INFO L225 Difference]: With dead ends: 209 [2024-10-14 20:07:45,070 INFO L226 Difference]: Without dead ends: 205 [2024-10-14 20:07:45,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-14 20:07:45,072 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 143 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:45,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 322 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-14 20:07:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2024-10-14 20:07:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 168 states have (on average 1.4523809523809523) internal successors, (244), 183 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 254 transitions. [2024-10-14 20:07:45,103 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 254 transitions. Word has length 15 [2024-10-14 20:07:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:45,104 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 254 transitions. [2024-10-14 20:07:45,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:07:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2024-10-14 20:07:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:07:45,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:45,105 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:45,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:07:45,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash 998018975, now seen corresponding path program 1 times [2024-10-14 20:07:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:45,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410981875] [2024-10-14 20:07:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:45,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:45,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410981875] [2024-10-14 20:07:45,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410981875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:45,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:45,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:45,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606503462] [2024-10-14 20:07:45,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:45,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:45,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:45,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:45,219 INFO L87 Difference]: Start difference. First operand 193 states and 254 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:07:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:45,346 INFO L93 Difference]: Finished difference Result 214 states and 274 transitions. [2024-10-14 20:07:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:45,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-14 20:07:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:45,348 INFO L225 Difference]: With dead ends: 214 [2024-10-14 20:07:45,348 INFO L226 Difference]: Without dead ends: 211 [2024-10-14 20:07:45,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-14 20:07:45,349 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 145 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:45,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 320 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-14 20:07:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2024-10-14 20:07:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 169 states have (on average 1.4142011834319526) internal successors, (239), 183 states have internal predecessors, (239), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 249 transitions. [2024-10-14 20:07:45,372 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 249 transitions. Word has length 15 [2024-10-14 20:07:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:45,372 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 249 transitions. [2024-10-14 20:07:45,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:07:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 249 transitions. [2024-10-14 20:07:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:07:45,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:45,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:45,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:07:45,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:45,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2140905350, now seen corresponding path program 1 times [2024-10-14 20:07:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:45,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556848118] [2024-10-14 20:07:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:45,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556848118] [2024-10-14 20:07:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556848118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:45,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604441838] [2024-10-14 20:07:45,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:45,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:45,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:45,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:45,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:45,480 INFO L87 Difference]: Start difference. First operand 193 states and 249 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10-14 20:07:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:45,606 INFO L93 Difference]: Finished difference Result 364 states and 463 transitions. [2024-10-14 20:07:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:07:45,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10-14 20:07:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:45,608 INFO L225 Difference]: With dead ends: 364 [2024-10-14 20:07:45,608 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 20:07:45,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:07:45,610 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:45,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 324 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 20:07:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 204. [2024-10-14 20:07:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 180 states have (on average 1.4) internal successors, (252), 194 states have internal predecessors, (252), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 262 transitions. [2024-10-14 20:07:45,638 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 262 transitions. Word has length 14 [2024-10-14 20:07:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:45,638 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 262 transitions. [2024-10-14 20:07:45,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10-14 20:07:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 262 transitions. [2024-10-14 20:07:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:07:45,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:45,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:45,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:07:45,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:45,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1731897374, now seen corresponding path program 1 times [2024-10-14 20:07:45,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:45,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019088840] [2024-10-14 20:07:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:45,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:45,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:45,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019088840] [2024-10-14 20:07:45,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019088840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:45,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:45,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:45,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121007686] [2024-10-14 20:07:45,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:45,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:45,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:45,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:45,696 INFO L87 Difference]: Start difference. First operand 204 states and 262 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) 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-10-14 20:07:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:45,754 INFO L93 Difference]: Finished difference Result 373 states and 477 transitions. [2024-10-14 20:07:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:45,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-10-14 20:07:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:45,757 INFO L225 Difference]: With dead ends: 373 [2024-10-14 20:07:45,757 INFO L226 Difference]: Without dead ends: 213 [2024-10-14 20:07:45,758 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-10-14 20:07:45,759 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 7 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:45,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 213 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-14 20:07:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2024-10-14 20:07:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 196 states have internal predecessors, (250), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2024-10-14 20:07:45,776 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 15 [2024-10-14 20:07:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:45,776 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2024-10-14 20:07:45,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-10-14 20:07:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2024-10-14 20:07:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:07:45,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:45,777 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:45,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:07:45,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:45,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash -745035786, now seen corresponding path program 1 times [2024-10-14 20:07:45,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170787593] [2024-10-14 20:07:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:45,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:45,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170787593] [2024-10-14 20:07:45,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170787593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:45,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754689785] [2024-10-14 20:07:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:45,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:45,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:45,852 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-10-14 20:07:45,854 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-10-14 20:07:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:45,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:45,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:45,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754689785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:45,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:07:45,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-14 20:07:45,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824734672] [2024-10-14 20:07:45,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:45,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:45,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:45,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:45,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:07:45,977 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-10-14 20:07:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:46,048 INFO L93 Difference]: Finished difference Result 223 states and 284 transitions. [2024-10-14 20:07:46,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:46,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-10-14 20:07:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:46,050 INFO L225 Difference]: With dead ends: 223 [2024-10-14 20:07:46,050 INFO L226 Difference]: Without dead ends: 222 [2024-10-14 20:07:46,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-10-14 20:07:46,051 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:46,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 311 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-14 20:07:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2024-10-14 20:07:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 178 states have (on average 1.3764044943820224) internal successors, (245), 192 states have internal predecessors, (245), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 255 transitions. [2024-10-14 20:07:46,069 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 255 transitions. Word has length 16 [2024-10-14 20:07:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:46,069 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 255 transitions. [2024-10-14 20:07:46,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-10-14 20:07:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 255 transitions. [2024-10-14 20:07:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:07:46,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:46,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:07:46,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:46,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:46,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:46,273 INFO L85 PathProgramCache]: Analyzing trace with hash -497764525, now seen corresponding path program 1 times [2024-10-14 20:07:46,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:46,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820532660] [2024-10-14 20:07:46,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:46,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820532660] [2024-10-14 20:07:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820532660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240902588] [2024-10-14 20:07:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:46,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:46,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:46,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:46,337 INFO L87 Difference]: Start difference. First operand 202 states and 255 transitions. Second operand has 4 states, 4 states have (on average 3.75) 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-10-14 20:07:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:46,399 INFO L93 Difference]: Finished difference Result 348 states and 438 transitions. [2024-10-14 20:07:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:46,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) 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-10-14 20:07:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:46,402 INFO L225 Difference]: With dead ends: 348 [2024-10-14 20:07:46,402 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 20:07:46,402 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-10-14 20:07:46,403 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:46,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 327 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 20:07:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-14 20:07:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 140 states have internal predecessors, (177), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 187 transitions. [2024-10-14 20:07:46,413 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 187 transitions. Word has length 16 [2024-10-14 20:07:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:46,413 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 187 transitions. [2024-10-14 20:07:46,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) 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-10-14 20:07:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 187 transitions. [2024-10-14 20:07:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:07:46,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:46,416 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:07:46,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:46,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:46,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1045950459, now seen corresponding path program 1 times [2024-10-14 20:07:46,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:46,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934297908] [2024-10-14 20:07:46,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:07:46,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934297908] [2024-10-14 20:07:46,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934297908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:46,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:46,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:46,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899575009] [2024-10-14 20:07:46,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:46,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:46,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:46,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:46,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:46,507 INFO L87 Difference]: Start difference. First operand 150 states and 187 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-14 20:07:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:46,619 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2024-10-14 20:07:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2024-10-14 20:07:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:46,620 INFO L225 Difference]: With dead ends: 164 [2024-10-14 20:07:46,620 INFO L226 Difference]: Without dead ends: 161 [2024-10-14 20:07:46,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-14 20:07:46,621 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 134 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:46,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 376 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-14 20:07:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2024-10-14 20:07:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.381679389312977) internal successors, (181), 144 states have internal predecessors, (181), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2024-10-14 20:07:46,629 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 21 [2024-10-14 20:07:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:46,630 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2024-10-14 20:07:46,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-14 20:07:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2024-10-14 20:07:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:07:46,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:46,630 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:07:46,631 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1017323103, now seen corresponding path program 1 times [2024-10-14 20:07:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:46,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639210968] [2024-10-14 20:07:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:46,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:07:46,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:46,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639210968] [2024-10-14 20:07:46,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639210968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:46,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:46,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933111899] [2024-10-14 20:07:46,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:46,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:46,685 INFO L87 Difference]: Start difference. First operand 154 states and 191 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-14 20:07:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:46,788 INFO L93 Difference]: Finished difference Result 163 states and 199 transitions. [2024-10-14 20:07:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:46,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2024-10-14 20:07:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:46,790 INFO L225 Difference]: With dead ends: 163 [2024-10-14 20:07:46,790 INFO L226 Difference]: Without dead ends: 161 [2024-10-14 20:07:46,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-14 20:07:46,791 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 138 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:46,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 381 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-14 20:07:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2024-10-14 20:07:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 126 states have (on average 1.373015873015873) internal successors, (173), 137 states have internal predecessors, (173), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 183 transitions. [2024-10-14 20:07:46,800 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 183 transitions. Word has length 21 [2024-10-14 20:07:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:46,801 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 183 transitions. [2024-10-14 20:07:46,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-14 20:07:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions. [2024-10-14 20:07:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 20:07:46,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:46,802 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 20:07:46,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:46,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1443853692, now seen corresponding path program 1 times [2024-10-14 20:07:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990362455] [2024-10-14 20:07:46,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:07:46,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:46,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990362455] [2024-10-14 20:07:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990362455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:46,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204517095] [2024-10-14 20:07:46,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:46,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:46,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:46,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:46,839 INFO L87 Difference]: Start difference. First operand 147 states and 183 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, (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-10-14 20:07:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:46,900 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2024-10-14 20:07:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:46,900 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-14 20:07:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:46,901 INFO L225 Difference]: With dead ends: 151 [2024-10-14 20:07:46,901 INFO L226 Difference]: Without dead ends: 149 [2024-10-14 20:07:46,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:46,902 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:46,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 208 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-14 20:07:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2024-10-14 20:07:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 125 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2024-10-14 20:07:46,911 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 20 [2024-10-14 20:07:46,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:46,911 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2024-10-14 20:07:46,911 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, (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-10-14 20:07:46,911 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2024-10-14 20:07:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 20:07:46,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:46,912 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 20:07:46,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:46,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash -887432495, now seen corresponding path program 1 times [2024-10-14 20:07:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:46,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729611271] [2024-10-14 20:07:46,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:07:46,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 20:07:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:07:46,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 20:07:46,949 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 20:07:46,950 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-10-14 20:07:46,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-10-14 20:07:46,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-10-14 20:07:46,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-10-14 20:07:46,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-10-14 20:07:46,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-10-14 20:07:46,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-10-14 20:07:46,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-10-14 20:07:46,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-10-14 20:07:46,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-10-14 20:07:46,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-10-14 20:07:46,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-10-14 20:07:46,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-10-14 20:07:46,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-10-14 20:07:46,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-10-14 20:07:46,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-10-14 20:07:46,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-10-14 20:07:46,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-10-14 20:07:46,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-10-14 20:07:46,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-10-14 20:07:46,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-10-14 20:07:46,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-10-14 20:07:46,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 20:07:46,959 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,985 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:07:46,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:07:46 BoogieIcfgContainer [2024-10-14 20:07:46,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:07:46,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:07:46,990 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:07:46,990 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:07:46,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:43" (3/4) ... [2024-10-14 20:07:46,993 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 20:07:46,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:07:46,995 INFO L158 Benchmark]: Toolchain (without parser) took 4385.06ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 75.8MB in the beginning and 152.6MB in the end (delta: -76.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:07:46,995 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 146.8MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:07:46,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.03ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 75.5MB in the beginning and 168.0MB in the end (delta: -92.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-14 20:07:46,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.63ms. Allocated memory is still 197.1MB. Free memory was 168.0MB in the beginning and 165.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:07:46,996 INFO L158 Benchmark]: Boogie Preprocessor took 60.50ms. Allocated memory is still 197.1MB. Free memory was 165.9MB in the beginning and 162.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:07:46,996 INFO L158 Benchmark]: RCFGBuilder took 706.09ms. Allocated memory is still 197.1MB. Free memory was 162.7MB in the beginning and 133.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 20:07:46,997 INFO L158 Benchmark]: TraceAbstraction took 3145.74ms. Allocated memory is still 197.1MB. Free memory was 132.3MB in the beginning and 153.6MB in the end (delta: -21.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:07:46,997 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 197.1MB. Free memory was 153.6MB in the beginning and 152.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:07:46,998 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.98ms. Allocated memory is still 146.8MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.03ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 75.5MB in the beginning and 168.0MB in the end (delta: -92.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.63ms. Allocated memory is still 197.1MB. Free memory was 168.0MB in the beginning and 165.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.50ms. Allocated memory is still 197.1MB. Free memory was 165.9MB in the beginning and 162.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 706.09ms. Allocated memory is still 197.1MB. Free memory was 162.7MB in the beginning and 133.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3145.74ms. Allocated memory is still 197.1MB. Free memory was 132.3MB in the beginning and 153.6MB in the end (delta: -21.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 197.1MB. Free memory was 153.6MB in the beginning and 152.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 80. Possible FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add ; [L237] unsigned int zero ; [L238] int sa ; [L239] int sb ; [L240] int tmp ; [L241] int tmp___0 ; [L242] int tmp___1 ; [L243] int tmp___2 ; [L244] int tmp___3 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L247] int tmp___6 ; [L248] int tmp___7 ; [L249] int tmp___8 ; [L250] int tmp___9 ; [L251] int __retres23 ; VAL [ea=0, eb=0] [L255] 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); [L255] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L255] zero = base2flt(0, 0) [L256] 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 3 procedures, 133 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 3672 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2287 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 790 IncrementalHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 1385 mSDtfsCounter, 790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=7, InterpolantAutomatonStates: 54, 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, 127 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 26/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 20:07:47,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-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 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:07:49,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:07:49,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-14 20:07:49,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:07:49,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:07:49,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:07:49,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:07:49,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:07:49,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:07:49,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:07:49,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:07:49,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:07:49,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:07:49,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:07:49,470 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:07:49,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:07:49,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:07:49,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:07:49,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:07:49,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:07:49,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:07:49,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:07:49,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:07:49,476 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 20:07:49,477 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 20:07:49,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:07:49,477 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:07:49,477 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 20:07:49,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:07:49,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:07:49,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:07:49,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:07:49,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:07:49,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:07:49,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:07:49,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:07:49,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:49,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:07:49,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:07:49,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:07:49,483 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 20:07:49,484 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 20:07:49,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:07:49,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:07:49,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:07:49,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:07:49,485 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 20:07:49,485 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 -> 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 [2024-10-14 20:07:49,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:07:49,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:07:49,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:07:49,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:07:49,886 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:07:49,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2024-10-14 20:07:51,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:07:51,746 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:07:51,747 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2024-10-14 20:07:51,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e263c43/e7bb503367404a2f834a4da06a92789c/FLAG6da25e961 [2024-10-14 20:07:51,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e263c43/e7bb503367404a2f834a4da06a92789c [2024-10-14 20:07:51,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:07:51,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:07:51,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:51,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:07:51,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:07:51,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:51" (1/1) ... [2024-10-14 20:07:51,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c82882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:51, skipping insertion in model container [2024-10-14 20:07:51,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:51" (1/1) ... [2024-10-14 20:07:51,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:07:52,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:52,115 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:07:52,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:52,202 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:07:52,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52 WrapperNode [2024-10-14 20:07:52,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:52,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:52,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:07:52,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:07:52,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,263 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 171 [2024-10-14 20:07:52,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:52,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:07:52,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:07:52,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:07:52,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,296 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-10-14 20:07:52,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:07:52,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:07:52,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:07:52,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:07:52,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (1/1) ... [2024-10-14 20:07:52,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:52,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:52,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:07:52,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:07:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:07:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 20:07:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-14 20:07:52,408 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-14 20:07:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:07:52,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:07:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:07:52,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:07:52,487 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:07:52,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:07:53,038 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-10-14 20:07:53,038 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:07:53,082 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:07:53,082 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:07:53,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:53 BoogieIcfgContainer [2024-10-14 20:07:53,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:07:53,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:07:53,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:07:53,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:07:53,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:07:51" (1/3) ... [2024-10-14 20:07:53,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1393f1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:53, skipping insertion in model container [2024-10-14 20:07:53,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:52" (2/3) ... [2024-10-14 20:07:53,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1393f1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:53, skipping insertion in model container [2024-10-14 20:07:53,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:53" (3/3) ... [2024-10-14 20:07:53,093 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2.c.cil.c [2024-10-14 20:07:53,112 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:07:53,113 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-14 20:07:53,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:07:53,184 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;@7edfe288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:07:53,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-14 20:07:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 75 states have (on average 1.76) internal successors, (132), 99 states have internal predecessors, (132), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 20:07:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:07:53,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:53,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:53,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:53,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1276681390, now seen corresponding path program 1 times [2024-10-14 20:07:53,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 20:07:53,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640546302] [2024-10-14 20:07:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:53,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 20:07:53,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 20:07:53,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 20:07:53,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 20:07:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:53,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 20:07:53,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:53,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:53,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 20:07:53,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640546302] [2024-10-14 20:07:53,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640546302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:53,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:53,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828305779] [2024-10-14 20:07:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:53,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:07:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 20:07:53,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:07:53,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:07:53,372 INFO L87 Difference]: Start difference. First operand has 108 states, 75 states have (on average 1.76) internal successors, (132), 99 states have internal predecessors, (132), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-14 20:07:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:53,415 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2024-10-14 20:07:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:07:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2024-10-14 20:07:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:53,426 INFO L225 Difference]: With dead ends: 205 [2024-10-14 20:07:53,427 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 20:07:53,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:07:53,438 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:53,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:53,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 20:07:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-14 20:07:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 67 states have internal predecessors, (79), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2024-10-14 20:07:53,496 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 8 [2024-10-14 20:07:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:53,498 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-10-14 20:07:53,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-14 20:07:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2024-10-14 20:07:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:07:53,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:53,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:53,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 20:07:53,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 20:07:53,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:53,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1275740124, now seen corresponding path program 1 times [2024-10-14 20:07:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 20:07:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924207812] [2024-10-14 20:07:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:53,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 20:07:53,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 20:07:53,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 20:07:53,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 20:07:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:53,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:53,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:53,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:53,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 20:07:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924207812] [2024-10-14 20:07:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924207812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:53,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:53,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:53,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088264255] [2024-10-14 20:07:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:53,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:53,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 20:07:53,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:53,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:53,794 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 20:07:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:53,876 INFO L93 Difference]: Finished difference Result 152 states and 180 transitions. [2024-10-14 20:07:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-14 20:07:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:53,877 INFO L225 Difference]: With dead ends: 152 [2024-10-14 20:07:53,878 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 20:07:53,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-14 20:07:53,879 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 3 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:53,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 239 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 20:07:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 20:07:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 70 states have internal predecessors, (82), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2024-10-14 20:07:53,890 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 8 [2024-10-14 20:07:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:53,890 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2024-10-14 20:07:53,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 20:07:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2024-10-14 20:07:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:07:53,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:53,892 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:53,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 20:07:54,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 20:07:54,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:54,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash 700859327, now seen corresponding path program 1 times [2024-10-14 20:07:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 20:07:54,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083393307] [2024-10-14 20:07:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:54,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 20:07:54,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 20:07:54,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 20:07:54,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 20:07:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:54,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 20:07:54,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:07:54,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:54,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 20:07:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083393307] [2024-10-14 20:07:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083393307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:54,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:54,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:54,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200334147] [2024-10-14 20:07:54,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:54,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 20:07:54,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:54,170 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10-14 20:07:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:54,220 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2024-10-14 20:07:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:54,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2024-10-14 20:07:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:54,223 INFO L225 Difference]: With dead ends: 79 [2024-10-14 20:07:54,223 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 20:07:54,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:54,225 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:54,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 151 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 20:07:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 20:07:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.396551724137931) internal successors, (81), 69 states have internal predecessors, (81), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2024-10-14 20:07:54,235 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 14 [2024-10-14 20:07:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:54,236 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2024-10-14 20:07:54,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10-14 20:07:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2024-10-14 20:07:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:07:54,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:54,237 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:54,241 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-10-14 20:07:54,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 20:07:54,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:54,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 103397671, now seen corresponding path program 1 times [2024-10-14 20:07:54,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 20:07:54,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078347339] [2024-10-14 20:07:54,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:54,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 20:07:54,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 20:07:54,447 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-10-14 20:07:54,448 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-10-14 20:07:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:54,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 20:07:54,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:07:54,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:54,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 20:07:54,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078347339] [2024-10-14 20:07:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078347339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:54,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244165500] [2024-10-14 20:07:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:54,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 20:07:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:54,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:54,504 INFO L87 Difference]: Start difference. First operand 78 states and 91 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-10-14 20:07:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:54,545 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2024-10-14 20:07:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:54,546 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-10-14 20:07:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:54,547 INFO L225 Difference]: With dead ends: 78 [2024-10-14 20:07:54,547 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 20:07:54,548 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-10-14 20:07:54,549 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:54,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 20:07:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 20:07:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 68 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2024-10-14 20:07:54,557 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 16 [2024-10-14 20:07:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:54,560 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2024-10-14 20:07:54,560 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-10-14 20:07:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2024-10-14 20:07:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:07:54,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:54,561 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:54,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 20:07:54,761 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-10-14 20:07:54,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:54,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:54,767 INFO L85 PathProgramCache]: Analyzing trace with hash 103465197, now seen corresponding path program 1 times [2024-10-14 20:07:54,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 20:07:54,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443985350] [2024-10-14 20:07:54,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:54,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 20:07:54,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 20:07:54,770 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-10-14 20:07:54,772 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-10-14 20:07:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:54,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:54,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:54,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:54,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 20:07:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443985350] [2024-10-14 20:07:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443985350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9367540] [2024-10-14 20:07:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:54,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 20:07:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:54,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:54,887 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-10-14 20:07:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:55,266 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2024-10-14 20:07:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:55,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2024-10-14 20:07:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:55,271 INFO L225 Difference]: With dead ends: 97 [2024-10-14 20:07:55,272 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 20:07:55,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-10-14 20:07:55,277 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 62 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:55,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 177 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:07:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 20:07:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2024-10-14 20:07:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.353846153846154) internal successors, (88), 75 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-10-14 20:07:55,302 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 16 [2024-10-14 20:07:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:55,304 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-10-14 20:07:55,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-10-14 20:07:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-10-14 20:07:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 20:07:55,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:55,307 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:55,314 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-10-14 20:07:55,507 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-10-14 20:07:55,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-14 20:07:55,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1454732356, now seen corresponding path program 1 times [2024-10-14 20:07:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 20:07:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270530564] [2024-10-14 20:07:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:55,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 20:07:55,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 20:07:55,512 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-10-14 20:07:55,513 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-10-14 20:07:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:07:55,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 20:07:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:07:55,582 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 20:07:55,582 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 20:07:55,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-10-14 20:07:55,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-10-14 20:07:55,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-10-14 20:07:55,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-10-14 20:07:55,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-10-14 20:07:55,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-10-14 20:07:55,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-10-14 20:07:55,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-10-14 20:07:55,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-10-14 20:07:55,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-10-14 20:07:55,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-10-14 20:07:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-10-14 20:07:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-10-14 20:07:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-10-14 20:07:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-10-14 20:07:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-10-14 20:07:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-10-14 20:07:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-10-14 20:07:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-10-14 20:07:55,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-10-14 20:07:55,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-10-14 20:07:55,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-10-14 20:07:55,603 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-10-14 20:07:55,792 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-10-14 20:07:55,796 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 20:07:55,817 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:07:55,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:07:55 BoogieIcfgContainer [2024-10-14 20:07:55,823 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:07:55,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:07:55,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:07:55,828 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:07:55,829 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:53" (3/4) ... [2024-10-14 20:07:55,830 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 20:07:55,881 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:07:55,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:07:55,882 INFO L158 Benchmark]: Toolchain (without parser) took 4100.34ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 44.8MB in the beginning and 47.0MB in the end (delta: -2.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-14 20:07:55,882 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 46.1MB. Free memory was 27.4MB in the beginning and 27.3MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:07:55,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.49ms. Allocated memory is still 65.0MB. Free memory was 44.6MB in the beginning and 28.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 20:07:55,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.85ms. Allocated memory is still 65.0MB. Free memory was 28.6MB in the beginning and 44.5MB in the end (delta: -15.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:07:55,883 INFO L158 Benchmark]: Boogie Preprocessor took 66.36ms. Allocated memory is still 65.0MB. Free memory was 44.5MB in the beginning and 42.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:07:55,883 INFO L158 Benchmark]: RCFGBuilder took 750.97ms. Allocated memory is still 65.0MB. Free memory was 41.7MB in the beginning and 34.2MB in the end (delta: 7.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-14 20:07:55,884 INFO L158 Benchmark]: TraceAbstraction took 2738.47ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 33.3MB in the beginning and 49.4MB in the end (delta: -16.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:07:55,884 INFO L158 Benchmark]: Witness Printer took 54.00ms. Allocated memory is still 81.8MB. Free memory was 49.0MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:07:55,886 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.22ms. Allocated memory is still 46.1MB. Free memory was 27.4MB in the beginning and 27.3MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.49ms. Allocated memory is still 65.0MB. Free memory was 44.6MB in the beginning and 28.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.85ms. Allocated memory is still 65.0MB. Free memory was 28.6MB in the beginning and 44.5MB in the end (delta: -15.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.36ms. Allocated memory is still 65.0MB. Free memory was 44.5MB in the beginning and 42.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 750.97ms. Allocated memory is still 65.0MB. Free memory was 41.7MB in the beginning and 34.2MB in the end (delta: 7.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2738.47ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 33.3MB in the beginning and 49.4MB in the end (delta: -16.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 54.00ms. Allocated memory is still 81.8MB. Free memory was 49.0MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 81]: integer overflow possible integer overflow possible We found a FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add ; [L237] unsigned int zero ; [L238] int sa ; [L239] int sb ; [L240] int tmp ; [L241] int tmp___0 ; [L242] int tmp___1 ; [L243] int tmp___2 ; [L244] int tmp___3 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L247] int tmp___6 ; [L248] int tmp___7 ; [L249] int tmp___8 ; [L250] int tmp___9 ; [L251] int __retres23 ; [L255] 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); [L255] RET, EXPR base2flt(0, 0) [L255] zero = base2flt(0, 0) [L256] 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 3 procedures, 108 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 846 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 399 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 447 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred 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, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 57 ConstructedInterpolants, 8 QuantifiedInterpolants, 102 SizeOfPredicates, 2 NumberOfNonLiveVariables, 152 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-10-14 20:07:55,922 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)