./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 22:02:09,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 22:02:09,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-22 22:02:09,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 22:02:09,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 22:02:09,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 22:02:09,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 22:02:09,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 22:02:09,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 22:02:09,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 22:02:09,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 22:02:09,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 22:02:09,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 22:02:09,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 22:02:09,394 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 22:02:09,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 22:02:09,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 22:02:09,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 22:02:09,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 22:02:09,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 22:02:09,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 22:02:09,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 22:02:09,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 22:02:09,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 22:02:09,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 22:02:09,402 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-22 22:02:09,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 22:02:09,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 22:02:09,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 22:02:09,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 22:02:09,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 22:02:09,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 22:02:09,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 22:02:09,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 22:02:09,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 22:02:09,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 22:02:09,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 22:02:09,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 22:02:09,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 22:02:09,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 22:02:09,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 22:02:09,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 22:02:09,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 22:02:09,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 22:02:09,408 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 [2024-11-22 22:02:09,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 22:02:09,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 22:02:09,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 22:02:09,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 22:02:09,684 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 22:02:09,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-22 22:02:11,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 22:02:11,365 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 22:02:11,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-22 22:02:11,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e46cfaa2/8fb850c5e3c44b47a37220d10be99e71/FLAGedef3f6ff [2024-11-22 22:02:11,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e46cfaa2/8fb850c5e3c44b47a37220d10be99e71 [2024-11-22 22:02:11,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 22:02:11,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 22:02:11,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 22:02:11,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 22:02:11,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 22:02:11,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:02:11" (1/1) ... [2024-11-22 22:02:11,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a71471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:11, skipping insertion in model container [2024-11-22 22:02:11,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:02:11" (1/1) ... [2024-11-22 22:02:11,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 22:02:11,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 22:02:11,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 22:02:12,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 22:02:12,057 INFO L204 MainTranslator]: Completed translation [2024-11-22 22:02:12,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12 WrapperNode [2024-11-22 22:02:12,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 22:02:12,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 22:02:12,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 22:02:12,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 22:02:12,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,097 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 162 [2024-11-22 22:02:12,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 22:02:12,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 22:02:12,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 22:02:12,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 22:02:12,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,129 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 22:02:12,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 22:02:12,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 22:02:12,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 22:02:12,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 22:02:12,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (1/1) ... [2024-11-22 22:02:12,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 22:02:12,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 22:02:12,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 22:02:12,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 22:02:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 22:02:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 22:02:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-22 22:02:12,253 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-22 22:02:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 22:02:12,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 22:02:12,253 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-22 22:02:12,253 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-22 22:02:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 22:02:12,255 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 22:02:12,353 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 22:02:12,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 22:02:12,845 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-22 22:02:12,847 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 22:02:12,866 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 22:02:12,867 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 22:02:12,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:02:12 BoogieIcfgContainer [2024-11-22 22:02:12,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 22:02:12,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 22:02:12,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 22:02:12,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 22:02:12,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:02:11" (1/3) ... [2024-11-22 22:02:12,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ae71b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:02:12, skipping insertion in model container [2024-11-22 22:02:12,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:12" (2/3) ... [2024-11-22 22:02:12,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ae71b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:02:12, skipping insertion in model container [2024-11-22 22:02:12,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:02:12" (3/3) ... [2024-11-22 22:02:12,878 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2024-11-22 22:02:12,896 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 22:02:12,897 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-22 22:02:12,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 22:02:12,968 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;@7ed3b694, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 22:02:12,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-22 22:02:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 110 states have internal predecessors, (142), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 22:02:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 22:02:12,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:12,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:12,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:12,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:12,986 INFO L85 PathProgramCache]: Analyzing trace with hash -12953697, now seen corresponding path program 1 times [2024-11-22 22:02:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98743451] [2024-11-22 22:02:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:13,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:13,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98743451] [2024-11-22 22:02:13,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98743451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:13,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:13,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 22:02:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409136836] [2024-11-22 22:02:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:13,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 22:02:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:13,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 22:02:13,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 22:02:13,247 INFO L87 Difference]: Start difference. First operand has 122 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 110 states have internal predecessors, (142), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:13,431 INFO L93 Difference]: Finished difference Result 295 states and 409 transitions. [2024-11-22 22:02:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 22:02:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 22:02:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:13,457 INFO L225 Difference]: With dead ends: 295 [2024-11-22 22:02:13,457 INFO L226 Difference]: Without dead ends: 166 [2024-11-22 22:02:13,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 22:02:13,467 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 90 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:13,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 390 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 22:02:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-22 22:02:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2024-11-22 22:02:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 125 states have (on average 1.496) internal successors, (187), 143 states have internal predecessors, (187), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 200 transitions. [2024-11-22 22:02:13,546 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 200 transitions. Word has length 9 [2024-11-22 22:02:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:13,546 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 200 transitions. [2024-11-22 22:02:13,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 200 transitions. [2024-11-22 22:02:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 22:02:13,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:13,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:13,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 22:02:13,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:13,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash -46694463, now seen corresponding path program 1 times [2024-11-22 22:02:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:13,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218542025] [2024-11-22 22:02:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:13,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:13,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218542025] [2024-11-22 22:02:13,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218542025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:13,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:13,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 22:02:13,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441089042] [2024-11-22 22:02:13,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:13,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:02:13,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:13,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:02:13,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:13,642 INFO L87 Difference]: Start difference. First operand 154 states and 200 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:13,709 INFO L93 Difference]: Finished difference Result 291 states and 376 transitions. [2024-11-22 22:02:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:02:13,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-22 22:02:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:13,715 INFO L225 Difference]: With dead ends: 291 [2024-11-22 22:02:13,715 INFO L226 Difference]: Without dead ends: 168 [2024-11-22 22:02:13,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:13,721 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:13,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 239 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:02:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-22 22:02:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2024-11-22 22:02:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 147 states have internal predecessors, (191), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2024-11-22 22:02:13,746 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 14 [2024-11-22 22:02:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:13,747 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2024-11-22 22:02:13,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2024-11-22 22:02:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 22:02:13,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:13,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:13,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 22:02:13,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:13,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash -46805809, now seen corresponding path program 1 times [2024-11-22 22:02:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762751329] [2024-11-22 22:02:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 22:02:13,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762751329] [2024-11-22 22:02:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762751329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:13,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 22:02:13,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218442481] [2024-11-22 22:02:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:13,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:02:13,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:13,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:02:13,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:13,805 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:13,853 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2024-11-22 22:02:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:02:13,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-22 22:02:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:13,855 INFO L225 Difference]: With dead ends: 158 [2024-11-22 22:02:13,856 INFO L226 Difference]: Without dead ends: 157 [2024-11-22 22:02:13,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:13,857 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:13,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:02:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-22 22:02:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-22 22:02:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 129 states have (on average 1.4651162790697674) internal successors, (189), 146 states have internal predecessors, (189), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2024-11-22 22:02:13,869 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 14 [2024-11-22 22:02:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:13,869 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2024-11-22 22:02:13,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2024-11-22 22:02:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 22:02:13,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:13,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:13,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 22:02:13,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:13,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1228715341, now seen corresponding path program 1 times [2024-11-22 22:02:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880418231] [2024-11-22 22:02:13,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880418231] [2024-11-22 22:02:13,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880418231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 22:02:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692143134] [2024-11-22 22:02:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 22:02:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 22:02:13,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 22:02:13,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 22:02:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:14,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 22:02:14,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 22:02:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:14,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 22:02:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692143134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:14,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 22:02:14,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-22 22:02:14,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328195904] [2024-11-22 22:02:14,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:14,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 22:02:14,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:14,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 22:02:14,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 22:02:14,081 INFO L87 Difference]: Start difference. First operand 157 states and 202 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:14,167 INFO L93 Difference]: Finished difference Result 183 states and 242 transitions. [2024-11-22 22:02:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 22:02:14,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-22 22:02:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:14,174 INFO L225 Difference]: With dead ends: 183 [2024-11-22 22:02:14,175 INFO L226 Difference]: Without dead ends: 181 [2024-11-22 22:02:14,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 22:02:14,177 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 32 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:14,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 236 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 22:02:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-22 22:02:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2024-11-22 22:02:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 153 states have internal predecessors, (196), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2024-11-22 22:02:14,200 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 15 [2024-11-22 22:02:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:14,204 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2024-11-22 22:02:14,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2024-11-22 22:02:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 22:02:14,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:14,205 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:14,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 22:02:14,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 22:02:14,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:14,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1450980022, now seen corresponding path program 1 times [2024-11-22 22:02:14,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:14,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368570743] [2024-11-22 22:02:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368570743] [2024-11-22 22:02:14,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368570743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 22:02:14,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436537038] [2024-11-22 22:02:14,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:14,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 22:02:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 22:02:14,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 22:02:14,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 22:02:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:14,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 22:02:14,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 22:02:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:14,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 22:02:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436537038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:14,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 22:02:14,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-22 22:02:14,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054564144] [2024-11-22 22:02:14,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:14,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:02:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:02:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 22:02:14,545 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:14,595 INFO L93 Difference]: Finished difference Result 170 states and 217 transitions. [2024-11-22 22:02:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:02:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-22 22:02:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:14,597 INFO L225 Difference]: With dead ends: 170 [2024-11-22 22:02:14,597 INFO L226 Difference]: Without dead ends: 169 [2024-11-22 22:02:14,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 22:02:14,599 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 17 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:14,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 223 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:02:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-22 22:02:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-22 22:02:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 138 states have (on average 1.434782608695652) internal successors, (198), 155 states have internal predecessors, (198), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2024-11-22 22:02:14,621 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 15 [2024-11-22 22:02:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:14,621 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2024-11-22 22:02:14,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2024-11-22 22:02:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 22:02:14,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:14,626 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:14,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 22:02:14,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 22:02:14,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:14,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1586966879, now seen corresponding path program 1 times [2024-11-22 22:02:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:14,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051988193] [2024-11-22 22:02:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051988193] [2024-11-22 22:02:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051988193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 22:02:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481831527] [2024-11-22 22:02:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:14,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 22:02:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 22:02:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 22:02:14,884 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:15,000 INFO L93 Difference]: Finished difference Result 235 states and 299 transitions. [2024-11-22 22:02:15,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 22:02:15,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-22 22:02:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:15,003 INFO L225 Difference]: With dead ends: 235 [2024-11-22 22:02:15,003 INFO L226 Difference]: Without dead ends: 231 [2024-11-22 22:02:15,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 22:02:15,004 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 85 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:15,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 422 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 22:02:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-22 22:02:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2024-11-22 22:02:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 186 states have (on average 1.424731182795699) internal successors, (265), 202 states have internal predecessors, (265), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 278 transitions. [2024-11-22 22:02:15,016 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 278 transitions. Word has length 17 [2024-11-22 22:02:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:15,016 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 278 transitions. [2024-11-22 22:02:15,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 278 transitions. [2024-11-22 22:02:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 22:02:15,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:15,017 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:15,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 22:02:15,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:15,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1558339523, now seen corresponding path program 1 times [2024-11-22 22:02:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349404544] [2024-11-22 22:02:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:15,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:15,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349404544] [2024-11-22 22:02:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349404544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:15,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 22:02:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946456572] [2024-11-22 22:02:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:15,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 22:02:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:15,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 22:02:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 22:02:15,087 INFO L87 Difference]: Start difference. First operand 214 states and 278 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:15,221 INFO L93 Difference]: Finished difference Result 236 states and 300 transitions. [2024-11-22 22:02:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 22:02:15,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-22 22:02:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:15,224 INFO L225 Difference]: With dead ends: 236 [2024-11-22 22:02:15,225 INFO L226 Difference]: Without dead ends: 233 [2024-11-22 22:02:15,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 22:02:15,226 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:15,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 422 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 22:02:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-22 22:02:15,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2024-11-22 22:02:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.3945945945945946) internal successors, (258), 200 states have internal predecessors, (258), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 271 transitions. [2024-11-22 22:02:15,243 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 271 transitions. Word has length 17 [2024-11-22 22:02:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:15,244 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 271 transitions. [2024-11-22 22:02:15,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 271 transitions. [2024-11-22 22:02:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 22:02:15,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:15,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:15,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 22:02:15,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:15,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1302492865, now seen corresponding path program 1 times [2024-11-22 22:02:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282919958] [2024-11-22 22:02:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:15,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:15,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282919958] [2024-11-22 22:02:15,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282919958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:15,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:15,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 22:02:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227390069] [2024-11-22 22:02:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:15,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:02:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:02:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:15,278 INFO L87 Difference]: Start difference. First operand 212 states and 271 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:15,319 INFO L93 Difference]: Finished difference Result 401 states and 510 transitions. [2024-11-22 22:02:15,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:02:15,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 22:02:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:15,321 INFO L225 Difference]: With dead ends: 401 [2024-11-22 22:02:15,321 INFO L226 Difference]: Without dead ends: 223 [2024-11-22 22:02:15,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:15,322 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:15,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 235 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:02:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-22 22:02:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 213. [2024-11-22 22:02:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.3655913978494623) internal successors, (254), 201 states have internal predecessors, (254), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 267 transitions. [2024-11-22 22:02:15,335 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 267 transitions. Word has length 16 [2024-11-22 22:02:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:15,335 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 267 transitions. [2024-11-22 22:02:15,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 267 transitions. [2024-11-22 22:02:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 22:02:15,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:15,336 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:15,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 22:02:15,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:15,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash -318397895, now seen corresponding path program 1 times [2024-11-22 22:02:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:15,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367420111] [2024-11-22 22:02:15,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:15,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:15,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367420111] [2024-11-22 22:02:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367420111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 22:02:15,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527852486] [2024-11-22 22:02:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:15,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 22:02:15,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 22:02:15,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 22:02:15,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 22:02:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:15,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 22:02:15,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 22:02:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:15,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 22:02:15,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527852486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:15,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 22:02:15,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-22 22:02:15,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317690326] [2024-11-22 22:02:15,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:15,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 22:02:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 22:02:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 22:02:15,485 INFO L87 Difference]: Start difference. First operand 213 states and 267 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:15,546 INFO L93 Difference]: Finished difference Result 227 states and 286 transitions. [2024-11-22 22:02:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 22:02:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 22:02:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:15,548 INFO L225 Difference]: With dead ends: 227 [2024-11-22 22:02:15,548 INFO L226 Difference]: Without dead ends: 226 [2024-11-22 22:02:15,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 22:02:15,549 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 9 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:15,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 341 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 22:02:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-22 22:02:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2024-11-22 22:02:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 200 states have internal predecessors, (251), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 264 transitions. [2024-11-22 22:02:15,562 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 264 transitions. Word has length 17 [2024-11-22 22:02:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:15,562 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 264 transitions. [2024-11-22 22:02:15,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 264 transitions. [2024-11-22 22:02:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 22:02:15,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:15,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:15,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 22:02:15,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 22:02:15,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:15,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash -71126634, now seen corresponding path program 1 times [2024-11-22 22:02:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737432274] [2024-11-22 22:02:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:15,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:15,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737432274] [2024-11-22 22:02:15,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737432274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:15,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:15,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 22:02:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12182282] [2024-11-22 22:02:15,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:15,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 22:02:15,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 22:02:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 22:02:15,843 INFO L87 Difference]: Start difference. First operand 212 states and 264 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:15,893 INFO L93 Difference]: Finished difference Result 374 states and 465 transitions. [2024-11-22 22:02:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 22:02:15,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 22:02:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:15,895 INFO L225 Difference]: With dead ends: 374 [2024-11-22 22:02:15,895 INFO L226 Difference]: Without dead ends: 167 [2024-11-22 22:02:15,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 22:02:15,896 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:15,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 357 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:02:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-22 22:02:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-22 22:02:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 155 states have internal predecessors, (193), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2024-11-22 22:02:15,904 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 17 [2024-11-22 22:02:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:15,904 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2024-11-22 22:02:15,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2024-11-22 22:02:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 22:02:15,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:15,905 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:15,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 22:02:15,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:15,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash 300413940, now seen corresponding path program 1 times [2024-11-22 22:02:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899076785] [2024-11-22 22:02:15,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 22:02:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:15,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899076785] [2024-11-22 22:02:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899076785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 22:02:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883156254] [2024-11-22 22:02:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:15,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 22:02:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:15,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 22:02:15,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 22:02:15,967 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 22:02:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:16,072 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2024-11-22 22:02:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 22:02:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-22 22:02:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:16,076 INFO L225 Difference]: With dead ends: 175 [2024-11-22 22:02:16,076 INFO L226 Difference]: Without dead ends: 172 [2024-11-22 22:02:16,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 22:02:16,077 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 76 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:16,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 473 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 22:02:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-22 22:02:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2024-11-22 22:02:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.3642857142857143) internal successors, (191), 153 states have internal predecessors, (191), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2024-11-22 22:02:16,088 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 24 [2024-11-22 22:02:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:16,089 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2024-11-22 22:02:16,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 22:02:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2024-11-22 22:02:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 22:02:16,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:16,090 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:16,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 22:02:16,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:16,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash 271786584, now seen corresponding path program 1 times [2024-11-22 22:02:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:16,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405288018] [2024-11-22 22:02:16,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 22:02:16,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 22:02:16,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405288018] [2024-11-22 22:02:16,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405288018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:16,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:16,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 22:02:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200671681] [2024-11-22 22:02:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:16,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 22:02:16,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 22:02:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 22:02:16,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 22:02:16,150 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 22:02:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:16,263 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2024-11-22 22:02:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 22:02:16,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-22 22:02:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:16,264 INFO L225 Difference]: With dead ends: 174 [2024-11-22 22:02:16,265 INFO L226 Difference]: Without dead ends: 172 [2024-11-22 22:02:16,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 22:02:16,265 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:16,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 480 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 22:02:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-22 22:02:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2024-11-22 22:02:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.3587786259541985) internal successors, (178), 142 states have internal predecessors, (178), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2024-11-22 22:02:16,273 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 24 [2024-11-22 22:02:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:16,273 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2024-11-22 22:02:16,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 22:02:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2024-11-22 22:02:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 22:02:16,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:16,274 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:16,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 22:02:16,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:16,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash -835364307, now seen corresponding path program 1 times [2024-11-22 22:02:16,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 22:02:16,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331020587] [2024-11-22 22:02:16,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 22:02:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 22:02:16,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 22:02:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 22:02:16,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 22:02:16,307 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 22:02:16,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-22 22:02:16,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-22 22:02:16,313 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-22 22:02:16,313 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-22 22:02:16,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-22 22:02:16,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-22 22:02:16,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-22 22:02:16,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-22 22:02:16,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-22 22:02:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-22 22:02:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-22 22:02:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-22 22:02:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-22 22:02:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-22 22:02:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-22 22:02:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-22 22:02:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-22 22:02:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-22 22:02:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-22 22:02:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-22 22:02:16,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-22 22:02:16,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-22 22:02:16,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 22:02:16,322 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:16,348 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 22:02:16,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:02:16 BoogieIcfgContainer [2024-11-22 22:02:16,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 22:02:16,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 22:02:16,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 22:02:16,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 22:02:16,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:02:12" (3/4) ... [2024-11-22 22:02:16,356 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 22:02:16,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 22:02:16,358 INFO L158 Benchmark]: Toolchain (without parser) took 4637.11ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 78.4MB in the beginning and 148.6MB in the end (delta: -70.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 22:02:16,358 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 151.0MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 22:02:16,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.48ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 78.2MB in the beginning and 165.5MB in the end (delta: -87.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-22 22:02:16,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.24ms. Allocated memory is still 197.1MB. Free memory was 165.5MB in the beginning and 163.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 22:02:16,359 INFO L158 Benchmark]: Boogie Preprocessor took 56.80ms. Allocated memory is still 197.1MB. Free memory was 163.4MB in the beginning and 161.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 22:02:16,360 INFO L158 Benchmark]: RCFGBuilder took 711.79ms. Allocated memory is still 197.1MB. Free memory was 161.3MB in the beginning and 137.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 22:02:16,360 INFO L158 Benchmark]: TraceAbstraction took 3481.73ms. Allocated memory is still 197.1MB. Free memory was 136.1MB in the beginning and 149.7MB in the end (delta: -13.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 22:02:16,360 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 197.1MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 22:02:16,361 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 151.0MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.48ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 78.2MB in the beginning and 165.5MB in the end (delta: -87.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.24ms. Allocated memory is still 197.1MB. Free memory was 165.5MB in the beginning and 163.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.80ms. Allocated memory is still 197.1MB. Free memory was 163.4MB in the beginning and 161.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 711.79ms. Allocated memory is still 197.1MB. Free memory was 161.3MB in the beginning and 137.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3481.73ms. Allocated memory is still 197.1MB. Free memory was 136.1MB in the beginning and 149.7MB in the end (delta: -13.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 197.1MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 80. Possible FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add1 ; [L237] unsigned int r_add2 ; [L238] unsigned int zero ; [L239] int tmp ; [L240] int tmp___0 ; [L241] int __retres14 ; VAL [ea=0, eb=0] [L245] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L84] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L245] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L245] zero = base2flt(0, 0) [L246] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L61] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L80] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L80] m = m & ~ (1U << 24U) [L81] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 122 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 4050 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2556 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 683 IncrementalHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 1494 mSDtfsCounter, 683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 129 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 35/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 22:02:16,388 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 ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 22:02:18,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 22:02:18,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-22 22:02:18,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 22:02:18,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 22:02:18,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 22:02:18,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 22:02:18,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 22:02:18,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 22:02:18,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 22:02:18,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 22:02:18,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 22:02:18,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 22:02:18,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 22:02:18,714 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 22:02:18,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 22:02:18,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 22:02:18,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 22:02:18,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 22:02:18,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 22:02:18,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 22:02:18,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 22:02:18,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 22:02:18,720 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 22:02:18,720 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 22:02:18,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 22:02:18,721 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-22 22:02:18,721 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 22:02:18,721 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 22:02:18,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 22:02:18,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 22:02:18,722 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 22:02:18,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 22:02:18,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 22:02:18,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 22:02:18,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 22:02:18,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 22:02:18,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 22:02:18,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 22:02:18,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 22:02:18,726 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 22:02:18,727 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 22:02:18,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 22:02:18,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 22:02:18,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 22:02:18,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 22:02:18,728 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 [2024-11-22 22:02:19,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 22:02:19,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 22:02:19,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 22:02:19,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 22:02:19,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 22:02:19,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-22 22:02:20,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 22:02:20,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 22:02:20,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-22 22:02:20,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b647215/1dea41aa90eb42689cc3efa96561c57c/FLAG389c1a585 [2024-11-22 22:02:20,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b647215/1dea41aa90eb42689cc3efa96561c57c [2024-11-22 22:02:20,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 22:02:20,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 22:02:21,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 22:02:21,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 22:02:21,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 22:02:21,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:02:20" (1/1) ... [2024-11-22 22:02:21,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450f1753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21, skipping insertion in model container [2024-11-22 22:02:21,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:02:20" (1/1) ... [2024-11-22 22:02:21,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 22:02:21,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 22:02:21,340 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 22:02:21,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 22:02:21,421 INFO L204 MainTranslator]: Completed translation [2024-11-22 22:02:21,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21 WrapperNode [2024-11-22 22:02:21,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 22:02:21,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 22:02:21,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 22:02:21,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 22:02:21,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,473 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-22 22:02:21,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 22:02:21,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 22:02:21,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 22:02:21,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 22:02:21,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,510 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 22:02:21,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 22:02:21,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 22:02:21,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 22:02:21,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 22:02:21,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (1/1) ... [2024-11-22 22:02:21,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 22:02:21,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 22:02:21,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 22:02:21,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 22:02:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 22:02:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 22:02:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-22 22:02:21,624 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-22 22:02:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 22:02:21,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 22:02:21,625 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-22 22:02:21,625 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-22 22:02:21,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 22:02:21,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 22:02:21,690 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 22:02:21,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 22:02:22,071 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-22 22:02:22,071 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 22:02:22,090 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 22:02:22,090 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 22:02:22,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:02:22 BoogieIcfgContainer [2024-11-22 22:02:22,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 22:02:22,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 22:02:22,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 22:02:22,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 22:02:22,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:02:20" (1/3) ... [2024-11-22 22:02:22,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aad226e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:02:22, skipping insertion in model container [2024-11-22 22:02:22,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:02:21" (2/3) ... [2024-11-22 22:02:22,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aad226e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:02:22, skipping insertion in model container [2024-11-22 22:02:22,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:02:22" (3/3) ... [2024-11-22 22:02:22,101 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2024-11-22 22:02:22,119 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 22:02:22,119 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-22 22:02:22,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 22:02:22,200 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;@5af0698d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 22:02:22,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-22 22:02:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 85 states have internal predecessors, (104), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 22:02:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 22:02:22,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:22,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:22,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:22,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash 68225597, now seen corresponding path program 1 times [2024-11-22 22:02:22,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 22:02:22,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288791520] [2024-11-22 22:02:22,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:22,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:22,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 22:02:22,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 22:02:22,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 22:02:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:22,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 22:02:22,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 22:02:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:22,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 22:02:22,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 22:02:22,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288791520] [2024-11-22 22:02:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288791520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:22,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:22,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 22:02:22,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232419656] [2024-11-22 22:02:22,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:22,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 22:02:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 22:02:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 22:02:22,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 22:02:22,356 INFO L87 Difference]: Start difference. First operand has 97 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 85 states have internal predecessors, (104), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:22,401 INFO L93 Difference]: Finished difference Result 181 states and 243 transitions. [2024-11-22 22:02:22,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 22:02:22,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 22:02:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:22,415 INFO L225 Difference]: With dead ends: 181 [2024-11-22 22:02:22,415 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 22:02:22,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 22:02:22,423 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:22,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:02:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 22:02:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-22 22:02:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 67 states have internal predecessors, (78), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-11-22 22:02:22,472 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 9 [2024-11-22 22:02:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:22,473 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-11-22 22:02:22,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2024-11-22 22:02:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 22:02:22,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:22,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:22,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 22:02:22,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:22,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:22,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 67284331, now seen corresponding path program 1 times [2024-11-22 22:02:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 22:02:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714390085] [2024-11-22 22:02:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:22,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:22,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 22:02:22,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 22:02:22,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 22:02:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:22,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 22:02:22,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 22:02:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:22,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 22:02:22,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 22:02:22,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714390085] [2024-11-22 22:02:22,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714390085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:22,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:22,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 22:02:22,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468111064] [2024-11-22 22:02:22,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:22,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 22:02:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 22:02:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 22:02:22,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 22:02:22,791 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:22,858 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2024-11-22 22:02:22,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 22:02:22,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 22:02:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:22,861 INFO L225 Difference]: With dead ends: 156 [2024-11-22 22:02:22,861 INFO L226 Difference]: Without dead ends: 82 [2024-11-22 22:02:22,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 22:02:22,863 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 4 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:22,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 251 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:02:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-22 22:02:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-22 22:02:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 71 states have internal predecessors, (82), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2024-11-22 22:02:22,876 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 9 [2024-11-22 22:02:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:22,879 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2024-11-22 22:02:22,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 22:02:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2024-11-22 22:02:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 22:02:22,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:22,880 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:22,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 22:02:23,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:23,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:23,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1241355163, now seen corresponding path program 1 times [2024-11-22 22:02:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 22:02:23,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098738303] [2024-11-22 22:02:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:23,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:23,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 22:02:23,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 22:02:23,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 22:02:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:23,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 22:02:23,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 22:02:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 22:02:23,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 22:02:23,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 22:02:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098738303] [2024-11-22 22:02:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098738303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:23,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 22:02:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846684417] [2024-11-22 22:02:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:23,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:02:23,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 22:02:23,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:02:23,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:23,140 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:23,195 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2024-11-22 22:02:23,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:02:23,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-22 22:02:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:23,197 INFO L225 Difference]: With dead ends: 82 [2024-11-22 22:02:23,198 INFO L226 Difference]: Without dead ends: 81 [2024-11-22 22:02:23,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:23,199 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:23,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 159 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:02:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-22 22:02:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-22 22:02:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.396551724137931) internal successors, (81), 70 states have internal predecessors, (81), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-11-22 22:02:23,209 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 16 [2024-11-22 22:02:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:23,210 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-11-22 22:02:23,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2024-11-22 22:02:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 22:02:23,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:23,211 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:23,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 22:02:23,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:23,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:23,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash -171146749, now seen corresponding path program 1 times [2024-11-22 22:02:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 22:02:23,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746059744] [2024-11-22 22:02:23,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:23,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:23,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 22:02:23,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 22:02:23,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 22:02:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:23,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 22:02:23,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 22:02:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 22:02:23,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 22:02:23,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 22:02:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746059744] [2024-11-22 22:02:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746059744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:23,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:23,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 22:02:23,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359496368] [2024-11-22 22:02:23,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:23,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 22:02:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 22:02:23,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 22:02:23,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:23,473 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:23,514 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-11-22 22:02:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 22:02:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-22 22:02:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:23,516 INFO L225 Difference]: With dead ends: 81 [2024-11-22 22:02:23,516 INFO L226 Difference]: Without dead ends: 80 [2024-11-22 22:02:23,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 22:02:23,517 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:23,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 22:02:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-22 22:02:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-22 22:02:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 69 states have internal predecessors, (80), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2024-11-22 22:02:23,530 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 18 [2024-11-22 22:02:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:23,531 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2024-11-22 22:02:23,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2024-11-22 22:02:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 22:02:23,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:23,536 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:23,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 22:02:23,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:23,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:23,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash -171079223, now seen corresponding path program 1 times [2024-11-22 22:02:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 22:02:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483846164] [2024-11-22 22:02:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 22:02:23,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 22:02:23,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 22:02:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 22:02:23,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 22:02:23,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 22:02:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 22:02:23,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 22:02:23,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 22:02:23,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483846164] [2024-11-22 22:02:23,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483846164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 22:02:23,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 22:02:23,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 22:02:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703389041] [2024-11-22 22:02:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 22:02:23,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 22:02:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 22:02:23,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 22:02:23,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 22:02:23,869 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 22:02:24,176 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2024-11-22 22:02:24,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 22:02:24,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-22 22:02:24,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 22:02:24,179 INFO L225 Difference]: With dead ends: 101 [2024-11-22 22:02:24,179 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 22:02:24,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 22:02:24,180 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 65 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 22:02:24,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 22:02:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 22:02:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2024-11-22 22:02:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.353846153846154) internal successors, (88), 76 states have internal predecessors, (88), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 22:02:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2024-11-22 22:02:24,201 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 18 [2024-11-22 22:02:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 22:02:24,201 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2024-11-22 22:02:24,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 22:02:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2024-11-22 22:02:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 22:02:24,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 22:02:24,203 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 22:02:24,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 22:02:24,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:24,406 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-22 22:02:24,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 22:02:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1505150304, now seen corresponding path program 1 times [2024-11-22 22:02:24,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 22:02:24,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767618921] [2024-11-22 22:02:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 22:02:24,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:24,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 22:02:24,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 22:02:24,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 22:02:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 22:02:24,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 22:02:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 22:02:24,490 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 22:02:24,490 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 22:02:24,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-22 22:02:24,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-22 22:02:24,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-22 22:02:24,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-22 22:02:24,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-22 22:02:24,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-22 22:02:24,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-22 22:02:24,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-22 22:02:24,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-22 22:02:24,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-22 22:02:24,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-22 22:02:24,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-22 22:02:24,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-22 22:02:24,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-22 22:02:24,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-22 22:02:24,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-22 22:02:24,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-22 22:02:24,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-22 22:02:24,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-22 22:02:24,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-22 22:02:24,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-22 22:02:24,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-22 22:02:24,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 22:02:24,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 22:02:24,703 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-22 22:02:24,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 22:02:24,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:02:24 BoogieIcfgContainer [2024-11-22 22:02:24,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 22:02:24,765 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 22:02:24,765 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 22:02:24,765 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 22:02:24,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:02:22" (3/4) ... [2024-11-22 22:02:24,766 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 22:02:24,823 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 22:02:24,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 22:02:24,824 INFO L158 Benchmark]: Toolchain (without parser) took 3825.20ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 45.1MB in the beginning and 55.3MB in the end (delta: -10.3MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2024-11-22 22:02:24,824 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory is still 28.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 22:02:24,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.83ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 46.1MB in the end (delta: -1.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 22:02:24,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.91ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 44.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 22:02:24,825 INFO L158 Benchmark]: Boogie Preprocessor took 67.44ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 41.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 22:02:24,825 INFO L158 Benchmark]: RCFGBuilder took 545.21ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 39.7MB in the end (delta: 2.1MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-22 22:02:24,825 INFO L158 Benchmark]: TraceAbstraction took 2670.55ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 39.3MB in the beginning and 57.4MB in the end (delta: -18.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-11-22 22:02:24,826 INFO L158 Benchmark]: Witness Printer took 58.36ms. Allocated memory is still 81.8MB. Free memory was 57.4MB in the beginning and 55.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 22:02:24,827 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.17ms. Allocated memory is still 52.4MB. Free memory is still 28.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.83ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 46.1MB in the end (delta: -1.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.91ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 44.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.44ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 41.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.21ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 39.7MB in the end (delta: 2.1MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2670.55ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 39.3MB in the beginning and 57.4MB in the end (delta: -18.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Witness Printer took 58.36ms. Allocated memory is still 81.8MB. Free memory was 57.4MB in the beginning and 55.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 81]: integer overflow possible integer overflow possible We found a FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add1 ; [L237] unsigned int r_add2 ; [L238] unsigned int zero ; [L239] int tmp ; [L240] int tmp___0 ; [L241] int __retres14 ; [L245] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L84] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L245] RET, EXPR base2flt(0, 0) [L245] zero = base2flt(0, 0) [L246] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L61] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L80] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 859 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 438 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 65 ConstructedInterpolants, 8 QuantifiedInterpolants, 110 SizeOfPredicates, 2 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-22 22:02:24,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)