./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:07:23,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:07:23,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:07:23,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:07:23,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:07:23,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:07:23,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:07:23,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:07:23,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:07:23,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:07:23,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:07:23,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:07:23,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:07:23,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:07:23,741 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:07:23,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:07:23,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:07:23,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:07:23,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:07:23,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:07:23,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:07:23,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:07:23,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:07:23,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:07:23,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:07:23,744 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:07:23,744 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:07:23,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:07:23,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:07:23,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:07:23,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:07:23,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:07:23,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:07:23,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:07:23,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:07:23,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:07:23,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:07:23,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:07:23,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:07:23,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:07:23,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:07:23,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:07:23,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:07:23,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:07:23,749 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-11-09 11:07:23,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:07:23,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:07:23,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:07:23,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:07:23,960 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:07:23,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-09 11:07:25,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:07:26,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:07:26,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-09 11:07:26,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b11e11c6/099ab06bb25a44f8a489b1d0df5860df/FLAG309c6d7b1 [2024-11-09 11:07:26,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b11e11c6/099ab06bb25a44f8a489b1d0df5860df [2024-11-09 11:07:26,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:07:26,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:07:26,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:07:26,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:07:26,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:07:26,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f79b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26, skipping insertion in model container [2024-11-09 11:07:26,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:07:26,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:07:26,681 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:07:26,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:07:26,738 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:07:26,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26 WrapperNode [2024-11-09 11:07:26,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:07:26,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:07:26,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:07:26,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:07:26,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,769 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-11-09 11:07:26,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:07:26,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:07:26,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:07:26,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:07:26,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,805 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-09 11:07:26,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:07:26,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:07:26,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:07:26,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:07:26,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (1/1) ... [2024-11-09 11:07:26,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:07:26,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:26,848 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-09 11:07:26,849 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-09 11:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-09 11:07:26,887 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-09 11:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:07:26,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-09 11:07:26,888 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-09 11:07:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:07:26,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:07:26,945 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:07:26,947 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:07:27,234 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-09 11:07:27,234 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:07:27,251 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:07:27,252 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:07:27,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:07:27 BoogieIcfgContainer [2024-11-09 11:07:27,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:07:27,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:07:27,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:07:27,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:07:27,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:07:26" (1/3) ... [2024-11-09 11:07:27,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107b5b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:07:27, skipping insertion in model container [2024-11-09 11:07:27,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:26" (2/3) ... [2024-11-09 11:07:27,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107b5b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:07:27, skipping insertion in model container [2024-11-09 11:07:27,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:07:27" (3/3) ... [2024-11-09 11:07:27,264 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-09 11:07:27,281 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:07:27,281 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-09 11:07:27,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:07:27,334 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;@10f6c552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:07:27,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-09 11:07:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 80 states have (on average 1.5875) internal successors, (127), 96 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 11:07:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 11:07:27,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:27,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:27,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1579713997, now seen corresponding path program 1 times [2024-11-09 11:07:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:27,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759260464] [2024-11-09 11:07:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:27,521 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-09 11:07:27,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:27,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759260464] [2024-11-09 11:07:27,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759260464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:27,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:27,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:07:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714520277] [2024-11-09 11:07:27,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:27,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:27,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:07:27,546 INFO L87 Difference]: Start difference. First operand has 109 states, 80 states have (on average 1.5875) internal successors, (127), 96 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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-09 11:07:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:27,739 INFO L93 Difference]: Finished difference Result 263 states and 377 transitions. [2024-11-09 11:07:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:27,742 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-09 11:07:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:27,749 INFO L225 Difference]: With dead ends: 263 [2024-11-09 11:07:27,749 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 11:07:27,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:27,755 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 85 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:27,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 359 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 11:07:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2024-11-09 11:07:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 125 states have internal predecessors, (167), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 182 transitions. [2024-11-09 11:07:27,792 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 182 transitions. Word has length 9 [2024-11-09 11:07:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:27,792 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 182 transitions. [2024-11-09 11:07:27,792 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-09 11:07:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2024-11-09 11:07:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:07:27,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:27,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:27,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:07:27,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:27,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1871380909, now seen corresponding path program 1 times [2024-11-09 11:07:27,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:27,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603530911] [2024-11-09 11:07:27,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:27,838 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-09 11:07:27,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:27,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603530911] [2024-11-09 11:07:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603530911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:27,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:27,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:07:27,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207105511] [2024-11-09 11:07:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:27,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:27,842 INFO L87 Difference]: Start difference. First operand 137 states and 182 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-09 11:07:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:27,885 INFO L93 Difference]: Finished difference Result 257 states and 340 transitions. [2024-11-09 11:07:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:27,885 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-09 11:07:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:27,887 INFO L225 Difference]: With dead ends: 257 [2024-11-09 11:07:27,887 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 11:07:27,888 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-09 11:07:27,888 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 215 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-09 11:07:27,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 215 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 11:07:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2024-11-09 11:07:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.4615384615384615) internal successors, (171), 129 states have internal predecessors, (171), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2024-11-09 11:07:27,901 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 186 transitions. Word has length 14 [2024-11-09 11:07:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:27,901 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 186 transitions. [2024-11-09 11:07:27,901 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-09 11:07:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2024-11-09 11:07:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:07:27,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:27,902 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:27,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:07:27,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:27,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1871492255, now seen corresponding path program 1 times [2024-11-09 11:07:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:27,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612694023] [2024-11-09 11:07:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:27,961 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-09 11:07:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612694023] [2024-11-09 11:07:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612694023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:27,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:27,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:07:27,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112122872] [2024-11-09 11:07:27,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:27,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:27,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:27,963 INFO L87 Difference]: Start difference. First operand 141 states and 186 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-09 11:07:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:27,996 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2024-11-09 11:07:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:27,997 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-09 11:07:27,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:27,998 INFO L225 Difference]: With dead ends: 141 [2024-11-09 11:07:27,998 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 11:07:27,998 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-09 11:07:27,999 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:28,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 214 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 11:07:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-09 11:07:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 128 states have internal predecessors, (169), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 184 transitions. [2024-11-09 11:07:28,009 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 184 transitions. Word has length 14 [2024-11-09 11:07:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:28,009 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 184 transitions. [2024-11-09 11:07:28,009 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-09 11:07:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 184 transitions. [2024-11-09 11:07:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:07:28,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:28,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:28,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:07:28,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:28,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash 498010363, now seen corresponding path program 1 times [2024-11-09 11:07:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:28,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834896989] [2024-11-09 11:07:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:28,139 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-09 11:07:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834896989] [2024-11-09 11:07:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834896989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322306963] [2024-11-09 11:07:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:28,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:28,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:28,142 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-09 11:07:28,143 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-09 11:07:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:28,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:07:28,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:28,253 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-09 11:07:28,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:28,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322306963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:28,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:28,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 11:07:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289433882] [2024-11-09 11:07:28,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:28,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:28,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:28,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:28,255 INFO L87 Difference]: Start difference. First operand 140 states and 184 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-09 11:07:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:28,362 INFO L93 Difference]: Finished difference Result 173 states and 234 transitions. [2024-11-09 11:07:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:28,363 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-09 11:07:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:28,365 INFO L225 Difference]: With dead ends: 173 [2024-11-09 11:07:28,366 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 11:07:28,367 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-09 11:07:28,370 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 25 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:28,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 322 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 11:07:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 147. [2024-11-09 11:07:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 135 states have internal predecessors, (176), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2024-11-09 11:07:28,395 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 15 [2024-11-09 11:07:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:28,395 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2024-11-09 11:07:28,395 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-09 11:07:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2024-11-09 11:07:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:07:28,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:28,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:28,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:07:28,600 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-09 11:07:28,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:28,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2113282296, now seen corresponding path program 1 times [2024-11-09 11:07:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:28,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118789916] [2024-11-09 11:07:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:28,698 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-09 11:07:28,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118789916] [2024-11-09 11:07:28,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118789916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555758907] [2024-11-09 11:07:28,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:28,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:28,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:28,702 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-09 11:07:28,703 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-09 11:07:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:28,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:07:28,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:28,791 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-09 11:07:28,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555758907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:28,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 11:07:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963195021] [2024-11-09 11:07:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:28,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:28,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:28,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:28,794 INFO L87 Difference]: Start difference. First operand 147 states and 191 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-09 11:07:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:28,848 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2024-11-09 11:07:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:28,852 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-09 11:07:28,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:28,853 INFO L225 Difference]: With dead ends: 153 [2024-11-09 11:07:28,853 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 11:07:28,853 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-09 11:07:28,854 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:28,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 211 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 11:07:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2024-11-09 11:07:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 137 states have internal predecessors, (178), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2024-11-09 11:07:28,869 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 15 [2024-11-09 11:07:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:28,869 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2024-11-09 11:07:28,869 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-09 11:07:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2024-11-09 11:07:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:07:28,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:28,870 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:28,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:07:29,071 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-09 11:07:29,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:29,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1067682539, now seen corresponding path program 1 times [2024-11-09 11:07:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:29,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144097242] [2024-11-09 11:07:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:29,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:29,168 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-09 11:07:29,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:29,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144097242] [2024-11-09 11:07:29,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144097242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:29,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:29,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:29,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332046154] [2024-11-09 11:07:29,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:29,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:29,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:29,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:29,175 INFO L87 Difference]: Start difference. First operand 149 states and 193 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-09 11:07:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:29,277 INFO L93 Difference]: Finished difference Result 216 states and 281 transitions. [2024-11-09 11:07:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:29,278 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-09 11:07:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:29,279 INFO L225 Difference]: With dead ends: 216 [2024-11-09 11:07:29,279 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 11:07:29,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:29,282 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:29,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 401 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 11:07:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 182. [2024-11-09 11:07:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 158 states have (on average 1.4240506329113924) internal successors, (225), 169 states have internal predecessors, (225), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 240 transitions. [2024-11-09 11:07:29,302 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 240 transitions. Word has length 17 [2024-11-09 11:07:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:29,302 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 240 transitions. [2024-11-09 11:07:29,302 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-09 11:07:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2024-11-09 11:07:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:07:29,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:29,303 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:29,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:07:29,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:29,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1039055183, now seen corresponding path program 1 times [2024-11-09 11:07:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:29,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868745132] [2024-11-09 11:07:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:29,354 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-09 11:07:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868745132] [2024-11-09 11:07:29,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868745132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:29,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:29,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:29,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540010974] [2024-11-09 11:07:29,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:29,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:29,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:29,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:29,356 INFO L87 Difference]: Start difference. First operand 182 states and 240 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-09 11:07:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:29,418 INFO L93 Difference]: Finished difference Result 208 states and 272 transitions. [2024-11-09 11:07:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:29,419 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-09 11:07:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:29,422 INFO L225 Difference]: With dead ends: 208 [2024-11-09 11:07:29,422 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 11:07:29,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:29,423 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 78 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:29,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 398 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 11:07:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2024-11-09 11:07:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 162 states have (on average 1.3950617283950617) internal successors, (226), 172 states have internal predecessors, (226), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 241 transitions. [2024-11-09 11:07:29,452 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 241 transitions. Word has length 17 [2024-11-09 11:07:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:29,452 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 241 transitions. [2024-11-09 11:07:29,452 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-09 11:07:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2024-11-09 11:07:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:07:29,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:29,453 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:29,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:07:29,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:29,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:29,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1848754791, now seen corresponding path program 1 times [2024-11-09 11:07:29,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:29,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779365670] [2024-11-09 11:07:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:29,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:29,500 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-09 11:07:29,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:29,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779365670] [2024-11-09 11:07:29,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779365670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:29,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976980631] [2024-11-09 11:07:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:29,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:29,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:29,506 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-09 11:07:29,515 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-09 11:07:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:29,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:07:29,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:29,568 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-09 11:07:29,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:29,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976980631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:29,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:29,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 11:07:29,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493834294] [2024-11-09 11:07:29,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:29,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:29,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:29,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:29,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:29,573 INFO L87 Difference]: Start difference. First operand 185 states and 241 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-09 11:07:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:29,618 INFO L93 Difference]: Finished difference Result 201 states and 265 transitions. [2024-11-09 11:07:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:29,619 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-09 11:07:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:29,620 INFO L225 Difference]: With dead ends: 201 [2024-11-09 11:07:29,621 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 11:07:29,621 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-09 11:07:29,622 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 8 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:29,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 325 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 11:07:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2024-11-09 11:07:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.3885350318471337) internal successors, (218), 167 states have internal predecessors, (218), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 233 transitions. [2024-11-09 11:07:29,629 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 233 transitions. Word has length 17 [2024-11-09 11:07:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:29,629 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 233 transitions. [2024-11-09 11:07:29,629 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-09 11:07:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 233 transitions. [2024-11-09 11:07:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:07:29,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:29,630 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-09 11:07:29,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:07:29,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:29,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:29,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1560658362, now seen corresponding path program 1 times [2024-11-09 11:07:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:29,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290127894] [2024-11-09 11:07:29,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:29,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:29,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:29,892 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-09 11:07:29,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:29,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290127894] [2024-11-09 11:07:29,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290127894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:29,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:29,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:29,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809630447] [2024-11-09 11:07:29,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:29,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:29,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:29,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:29,894 INFO L87 Difference]: Start difference. First operand 180 states and 233 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-09 11:07:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:29,963 INFO L93 Difference]: Finished difference Result 198 states and 257 transitions. [2024-11-09 11:07:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:29,964 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-09 11:07:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:29,966 INFO L225 Difference]: With dead ends: 198 [2024-11-09 11:07:29,966 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 11:07:29,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:29,967 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 75 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:29,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 393 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 11:07:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2024-11-09 11:07:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.38) internal successors, (207), 158 states have internal predecessors, (207), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 222 transitions. [2024-11-09 11:07:29,977 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 222 transitions. Word has length 24 [2024-11-09 11:07:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 222 transitions. [2024-11-09 11:07:29,978 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-09 11:07:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 222 transitions. [2024-11-09 11:07:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:07:29,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:29,980 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-09 11:07:29,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:07:29,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:29,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1589285718, now seen corresponding path program 1 times [2024-11-09 11:07:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:29,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847027477] [2024-11-09 11:07:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,028 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-09 11:07:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847027477] [2024-11-09 11:07:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847027477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:30,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:30,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:30,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086454828] [2024-11-09 11:07:30,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:30,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:30,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:30,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:30,030 INFO L87 Difference]: Start difference. First operand 171 states and 222 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-09 11:07:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:30,084 INFO L93 Difference]: Finished difference Result 189 states and 246 transitions. [2024-11-09 11:07:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:30,085 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-09 11:07:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:30,086 INFO L225 Difference]: With dead ends: 189 [2024-11-09 11:07:30,086 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 11:07:30,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:30,087 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 76 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:30,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 391 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 11:07:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 160. [2024-11-09 11:07:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.375886524822695) internal successors, (194), 147 states have internal predecessors, (194), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2024-11-09 11:07:30,096 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 24 [2024-11-09 11:07:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:30,096 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2024-11-09 11:07:30,096 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-09 11:07:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2024-11-09 11:07:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 11:07:30,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:30,098 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:30,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:07:30,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:30,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash 76784724, now seen corresponding path program 1 times [2024-11-09 11:07:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:30,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551466139] [2024-11-09 11:07:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 11:07:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:07:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:30,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:30,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551466139] [2024-11-09 11:07:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551466139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997752509] [2024-11-09 11:07:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:30,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:30,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:30,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:07:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:07:30,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:07:30,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:30,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997752509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:30,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:30,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-09 11:07:30,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395121250] [2024-11-09 11:07:30,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:30,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:30,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:30,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:30,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:07:30,416 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:07:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:30,459 INFO L93 Difference]: Finished difference Result 160 states and 209 transitions. [2024-11-09 11:07:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:07:30,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-09 11:07:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:30,460 INFO L225 Difference]: With dead ends: 160 [2024-11-09 11:07:30,460 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 11:07:30,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:07:30,461 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:30,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 11:07:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-09 11:07:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 141 states have (on average 1.3687943262411348) internal successors, (193), 146 states have internal predecessors, (193), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:07:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 208 transitions. [2024-11-09 11:07:30,469 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 208 transitions. Word has length 41 [2024-11-09 11:07:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:30,470 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 208 transitions. [2024-11-09 11:07:30,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:07:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2024-11-09 11:07:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 11:07:30,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:30,471 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:30,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 11:07:30,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:30,675 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:30,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1914640641, now seen corresponding path program 1 times [2024-11-09 11:07:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841703035] [2024-11-09 11:07:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 11:07:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:07:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:30,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:30,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841703035] [2024-11-09 11:07:30,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841703035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:30,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094184099] [2024-11-09 11:07:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:30,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:30,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:30,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:30,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:07:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:30,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 11:07:30,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:30,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:31,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094184099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:31,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:31,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-09 11:07:31,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360771794] [2024-11-09 11:07:31,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:31,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 11:07:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:31,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 11:07:31,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:07:31,217 INFO L87 Difference]: Start difference. First operand 159 states and 208 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:07:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:31,346 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2024-11-09 11:07:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:07:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 42 [2024-11-09 11:07:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:31,348 INFO L225 Difference]: With dead ends: 233 [2024-11-09 11:07:31,348 INFO L226 Difference]: Without dead ends: 181 [2024-11-09 11:07:31,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-09 11:07:31,349 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 10 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:31,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1352 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-09 11:07:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2024-11-09 11:07:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 156 states have internal predecessors, (203), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-09 11:07:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2024-11-09 11:07:31,371 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 223 transitions. Word has length 42 [2024-11-09 11:07:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:31,371 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 223 transitions. [2024-11-09 11:07:31,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:07:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 223 transitions. [2024-11-09 11:07:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 11:07:31,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:31,372 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:31,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:07:31,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 11:07:31,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:31,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1238779448, now seen corresponding path program 1 times [2024-11-09 11:07:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:31,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518381711] [2024-11-09 11:07:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:31,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 11:07:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:07:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:07:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:31,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:31,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518381711] [2024-11-09 11:07:31,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518381711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:31,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:31,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 11:07:31,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946726136] [2024-11-09 11:07:31,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:31,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:07:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:07:31,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:07:31,775 INFO L87 Difference]: Start difference. First operand 172 states and 223 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 11:07:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:31,869 INFO L93 Difference]: Finished difference Result 281 states and 360 transitions. [2024-11-09 11:07:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:07:31,870 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2024-11-09 11:07:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:31,871 INFO L225 Difference]: With dead ends: 281 [2024-11-09 11:07:31,872 INFO L226 Difference]: Without dead ends: 223 [2024-11-09 11:07:31,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:07:31,872 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 105 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:31,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 865 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-09 11:07:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 215. [2024-11-09 11:07:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 186 states have (on average 1.3387096774193548) internal successors, (249), 192 states have internal predecessors, (249), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-09 11:07:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 282 transitions. [2024-11-09 11:07:31,885 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 282 transitions. Word has length 50 [2024-11-09 11:07:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:31,885 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 282 transitions. [2024-11-09 11:07:31,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 11:07:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2024-11-09 11:07:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 11:07:31,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:31,887 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:31,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 11:07:31,887 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:31,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1714366512, now seen corresponding path program 1 times [2024-11-09 11:07:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208543642] [2024-11-09 11:07:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:07:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:32,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:32,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208543642] [2024-11-09 11:07:32,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208543642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:32,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:32,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 11:07:32,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929611636] [2024-11-09 11:07:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:32,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:07:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:32,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:07:32,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:07:32,082 INFO L87 Difference]: Start difference. First operand 215 states and 282 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:32,142 INFO L93 Difference]: Finished difference Result 318 states and 412 transitions. [2024-11-09 11:07:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:07:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-09 11:07:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:32,144 INFO L225 Difference]: With dead ends: 318 [2024-11-09 11:07:32,144 INFO L226 Difference]: Without dead ends: 230 [2024-11-09 11:07:32,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:07:32,145 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 7 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:32,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 738 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-09 11:07:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 219. [2024-11-09 11:07:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 190 states have (on average 1.331578947368421) internal successors, (253), 196 states have internal predecessors, (253), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-09 11:07:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2024-11-09 11:07:32,172 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 46 [2024-11-09 11:07:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:32,173 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2024-11-09 11:07:32,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2024-11-09 11:07:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 11:07:32,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:32,178 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:32,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:07:32,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:32,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash -209019844, now seen corresponding path program 1 times [2024-11-09 11:07:32,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:32,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385992708] [2024-11-09 11:07:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:32,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 11:07:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:07:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:07:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385992708] [2024-11-09 11:07:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385992708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976382353] [2024-11-09 11:07:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:32,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:32,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:32,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:32,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:07:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:32,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 11:07:32,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:32,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:32,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976382353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:32,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:32,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-09 11:07:32,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624982631] [2024-11-09 11:07:32,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:32,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:07:32,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:32,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:07:32,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:07:32,555 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:07:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:32,672 INFO L93 Difference]: Finished difference Result 316 states and 408 transitions. [2024-11-09 11:07:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:07:32,673 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 50 [2024-11-09 11:07:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:32,674 INFO L225 Difference]: With dead ends: 316 [2024-11-09 11:07:32,674 INFO L226 Difference]: Without dead ends: 209 [2024-11-09 11:07:32,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:07:32,675 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 5 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:32,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1209 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-09 11:07:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-09 11:07:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 186 states have internal predecessors, (241), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 11:07:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 266 transitions. [2024-11-09 11:07:32,686 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 266 transitions. Word has length 50 [2024-11-09 11:07:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:32,686 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 266 transitions. [2024-11-09 11:07:32,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:07:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 266 transitions. [2024-11-09 11:07:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 11:07:32,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:32,687 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:32,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:07:32,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 11:07:32,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:32,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:32,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1874745825, now seen corresponding path program 2 times [2024-11-09 11:07:32,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:32,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85738129] [2024-11-09 11:07:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:07:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:07:33,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:33,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85738129] [2024-11-09 11:07:33,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85738129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:33,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399334412] [2024-11-09 11:07:33,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:07:33,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:33,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:33,075 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:33,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:07:33,129 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:07:33,130 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:07:33,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:07:33,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 11:07:33,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399334412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:33,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-09 11:07:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790862313] [2024-11-09 11:07:33,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:33,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:33,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:07:33,385 INFO L87 Difference]: Start difference. First operand 206 states and 266 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:33,475 INFO L93 Difference]: Finished difference Result 206 states and 266 transitions. [2024-11-09 11:07:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:07:33,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2024-11-09 11:07:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:33,476 INFO L225 Difference]: With dead ends: 206 [2024-11-09 11:07:33,476 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 11:07:33,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:07:33,477 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 6 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:33,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 368 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 11:07:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-09 11:07:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 181 states have (on average 1.3204419889502763) internal successors, (239), 185 states have internal predecessors, (239), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 11:07:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 264 transitions. [2024-11-09 11:07:33,486 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 264 transitions. Word has length 50 [2024-11-09 11:07:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:33,486 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 264 transitions. [2024-11-09 11:07:33,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 264 transitions. [2024-11-09 11:07:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 11:07:33,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:33,487 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:33,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:07:33,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:33,692 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:33,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash 513828028, now seen corresponding path program 1 times [2024-11-09 11:07:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:33,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768995543] [2024-11-09 11:07:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:07:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 11:07:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 11:07:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 11:07:33,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:33,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768995543] [2024-11-09 11:07:33,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768995543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:33,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:33,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:07:33,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258820452] [2024-11-09 11:07:33,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:33,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:33,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:33,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:33,770 INFO L87 Difference]: Start difference. First operand 205 states and 264 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:07:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:33,810 INFO L93 Difference]: Finished difference Result 208 states and 267 transitions. [2024-11-09 11:07:33,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:33,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2024-11-09 11:07:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:33,811 INFO L225 Difference]: With dead ends: 208 [2024-11-09 11:07:33,811 INFO L226 Difference]: Without dead ends: 206 [2024-11-09 11:07:33,812 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-09 11:07:33,812 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 22 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:33,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 163 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-09 11:07:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-11-09 11:07:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 181 states have (on average 1.298342541436464) internal successors, (235), 183 states have internal predecessors, (235), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 11:07:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 260 transitions. [2024-11-09 11:07:33,820 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 260 transitions. Word has length 70 [2024-11-09 11:07:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:33,820 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 260 transitions. [2024-11-09 11:07:33,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:07:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 260 transitions. [2024-11-09 11:07:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 11:07:33,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:33,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:33,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:07:33,821 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:33,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1052758442, now seen corresponding path program 1 times [2024-11-09 11:07:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723175982] [2024-11-09 11:07:33,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:33,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:07:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 11:07:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 11:07:34,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:34,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723175982] [2024-11-09 11:07:34,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723175982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:34,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:34,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 11:07:34,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501885509] [2024-11-09 11:07:34,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:34,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:07:34,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:34,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:07:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:07:34,013 INFO L87 Difference]: Start difference. First operand 203 states and 260 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:34,228 INFO L93 Difference]: Finished difference Result 331 states and 431 transitions. [2024-11-09 11:07:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:07:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-11-09 11:07:34,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:34,230 INFO L225 Difference]: With dead ends: 331 [2024-11-09 11:07:34,230 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 11:07:34,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:07:34,231 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 32 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:34,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 658 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:07:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 11:07:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 229. [2024-11-09 11:07:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 203 states have (on average 1.2857142857142858) internal successors, (261), 205 states have internal predecessors, (261), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2024-11-09 11:07:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 294 transitions. [2024-11-09 11:07:34,242 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 294 transitions. Word has length 63 [2024-11-09 11:07:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:34,242 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 294 transitions. [2024-11-09 11:07:34,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 294 transitions. [2024-11-09 11:07:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 11:07:34,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:34,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:34,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 11:07:34,244 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:34,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -81853448, now seen corresponding path program 1 times [2024-11-09 11:07:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:34,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388300161] [2024-11-09 11:07:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:07:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 11:07:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 11:07:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:07:34,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388300161] [2024-11-09 11:07:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388300161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72239174] [2024-11-09 11:07:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:34,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:34,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:34,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:34,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:07:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:34,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 11:07:34,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:07:34,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:34,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72239174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:34,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:34,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 13 [2024-11-09 11:07:34,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543675315] [2024-11-09 11:07:34,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:34,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:07:34,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:34,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:07:34,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:07:34,595 INFO L87 Difference]: Start difference. First operand 229 states and 294 transitions. Second operand has 11 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 11:07:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:34,782 INFO L93 Difference]: Finished difference Result 371 states and 481 transitions. [2024-11-09 11:07:34,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:07:34,782 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 72 [2024-11-09 11:07:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:34,784 INFO L225 Difference]: With dead ends: 371 [2024-11-09 11:07:34,785 INFO L226 Difference]: Without dead ends: 309 [2024-11-09 11:07:34,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:07:34,786 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 59 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:34,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1342 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-09 11:07:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 240. [2024-11-09 11:07:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 210 states have (on average 1.2809523809523808) internal successors, (269), 214 states have internal predecessors, (269), 19 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (21), 18 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-09 11:07:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 309 transitions. [2024-11-09 11:07:34,804 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 309 transitions. Word has length 72 [2024-11-09 11:07:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:34,805 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 309 transitions. [2024-11-09 11:07:34,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 11:07:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 309 transitions. [2024-11-09 11:07:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 11:07:34,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:34,809 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:34,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:07:35,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:35,014 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:35,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1774869631, now seen corresponding path program 1 times [2024-11-09 11:07:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:35,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569783620] [2024-11-09 11:07:35,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:35,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:07:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 11:07:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 11:07:35,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569783620] [2024-11-09 11:07:35,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569783620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:35,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:35,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:07:35,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558567687] [2024-11-09 11:07:35,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:35,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:35,099 INFO L87 Difference]: Start difference. First operand 240 states and 309 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:35,125 INFO L93 Difference]: Finished difference Result 252 states and 324 transitions. [2024-11-09 11:07:35,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:35,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-11-09 11:07:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:35,126 INFO L225 Difference]: With dead ends: 252 [2024-11-09 11:07:35,126 INFO L226 Difference]: Without dead ends: 246 [2024-11-09 11:07:35,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:35,127 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:35,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 170 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-09 11:07:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2024-11-09 11:07:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 213 states have (on average 1.2629107981220657) internal successors, (269), 216 states have internal predecessors, (269), 20 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2024-11-09 11:07:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 311 transitions. [2024-11-09 11:07:35,137 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 311 transitions. Word has length 64 [2024-11-09 11:07:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:35,138 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 311 transitions. [2024-11-09 11:07:35,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 311 transitions. [2024-11-09 11:07:35,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 11:07:35,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:35,139 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:35,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 11:07:35,139 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:35,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash -513553131, now seen corresponding path program 1 times [2024-11-09 11:07:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:35,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490306941] [2024-11-09 11:07:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:35,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:07:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 11:07:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:07:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 11:07:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:35,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490306941] [2024-11-09 11:07:35,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490306941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:35,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349432406] [2024-11-09 11:07:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:35,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:35,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:35,546 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:35,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:07:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:35,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 11:07:35,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 11:07:35,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:35,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349432406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:35,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:35,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 19 [2024-11-09 11:07:35,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676360998] [2024-11-09 11:07:35,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:35,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:07:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:35,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:07:35,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-09 11:07:35,688 INFO L87 Difference]: Start difference. First operand 243 states and 311 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:07:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:35,795 INFO L93 Difference]: Finished difference Result 387 states and 496 transitions. [2024-11-09 11:07:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:07:35,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2024-11-09 11:07:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:35,797 INFO L225 Difference]: With dead ends: 387 [2024-11-09 11:07:35,797 INFO L226 Difference]: Without dead ends: 318 [2024-11-09 11:07:35,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:07:35,798 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 61 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:35,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 859 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-09 11:07:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 308. [2024-11-09 11:07:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 268 states have (on average 1.257462686567164) internal successors, (337), 272 states have internal predecessors, (337), 28 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (31), 27 states have call predecessors, (31), 25 states have call successors, (31) [2024-11-09 11:07:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 396 transitions. [2024-11-09 11:07:35,817 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 396 transitions. Word has length 72 [2024-11-09 11:07:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:35,817 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 396 transitions. [2024-11-09 11:07:35,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:07:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 396 transitions. [2024-11-09 11:07:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 11:07:35,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:35,819 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:35,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 11:07:36,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:36,020 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:36,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1936046999, now seen corresponding path program 1 times [2024-11-09 11:07:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:36,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125683401] [2024-11-09 11:07:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:36,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:36,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:36,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:07:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:36,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 11:07:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:36,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:07:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 11:07:36,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125683401] [2024-11-09 11:07:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125683401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:36,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 11:07:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24829472] [2024-11-09 11:07:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:36,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:07:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:07:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:07:36,345 INFO L87 Difference]: Start difference. First operand 308 states and 396 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:07:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:36,544 INFO L93 Difference]: Finished difference Result 466 states and 603 transitions. [2024-11-09 11:07:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 11:07:36,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2024-11-09 11:07:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:36,545 INFO L225 Difference]: With dead ends: 466 [2024-11-09 11:07:36,545 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:07:36,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:07:36,547 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 122 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:36,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 833 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:07:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:07:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:07:36,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-11-09 11:07:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:36,549 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:07:36,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:07:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:07:36,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:07:36,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-11-09 11:07:36,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-11-09 11:07:36,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-11-09 11:07:36,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-11-09 11:07:36,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-11-09 11:07:36,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-11-09 11:07:36,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-11-09 11:07:36,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-11-09 11:07:36,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-11-09 11:07:36,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-11-09 11:07:36,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-11-09 11:07:36,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-11-09 11:07:36,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-11-09 11:07:36,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-11-09 11:07:36,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-11-09 11:07:36,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-11-09 11:07:36,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 11:07:36,562 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:36,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:07:37,202 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:07:37,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:07:37 BoogieIcfgContainer [2024-11-09 11:07:37,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:07:37,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:07:37,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:07:37,223 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:07:37,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:07:27" (3/4) ... [2024-11-09 11:07:37,227 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:07:37,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-11-09 11:07:37,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2024-11-09 11:07:37,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:07:37,236 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2024-11-09 11:07:37,237 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-09 11:07:37,237 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:07:37,237 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:07:37,261 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) [2024-11-09 11:07:37,261 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2024-11-09 11:07:37,281 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2024-11-09 11:07:37,282 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) [2024-11-09 11:07:37,320 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:07:37,321 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:07:37,321 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:07:37,321 INFO L158 Benchmark]: Toolchain (without parser) took 10878.41ms. Allocated memory was 130.0MB in the beginning and 299.9MB in the end (delta: 169.9MB). Free memory was 59.9MB in the beginning and 118.1MB in the end (delta: -58.2MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2024-11-09 11:07:37,321 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 130.0MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:07:37,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.62ms. Allocated memory was 130.0MB in the beginning and 195.0MB in the end (delta: 65.0MB). Free memory was 59.6MB in the beginning and 165.3MB in the end (delta: -105.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-09 11:07:37,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.30ms. Allocated memory is still 195.0MB. Free memory was 165.3MB in the beginning and 163.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:07:37,324 INFO L158 Benchmark]: Boogie Preprocessor took 47.07ms. Allocated memory is still 195.0MB. Free memory was 163.2MB in the beginning and 161.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:07:37,324 INFO L158 Benchmark]: RCFGBuilder took 435.83ms. Allocated memory is still 195.0MB. Free memory was 161.1MB in the beginning and 138.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 11:07:37,324 INFO L158 Benchmark]: TraceAbstraction took 9966.41ms. Allocated memory was 195.0MB in the beginning and 299.9MB in the end (delta: 104.9MB). Free memory was 137.0MB in the beginning and 125.5MB in the end (delta: 11.5MB). Peak memory consumption was 147.8MB. Max. memory is 16.1GB. [2024-11-09 11:07:37,324 INFO L158 Benchmark]: Witness Printer took 97.80ms. Allocated memory is still 299.9MB. Free memory was 124.4MB in the beginning and 118.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 11:07:37,325 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.71ms. Allocated memory is still 130.0MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.62ms. Allocated memory was 130.0MB in the beginning and 195.0MB in the end (delta: 65.0MB). Free memory was 59.6MB in the beginning and 165.3MB in the end (delta: -105.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.30ms. Allocated memory is still 195.0MB. Free memory was 165.3MB in the beginning and 163.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.07ms. Allocated memory is still 195.0MB. Free memory was 163.2MB in the beginning and 161.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 435.83ms. Allocated memory is still 195.0MB. Free memory was 161.1MB in the beginning and 138.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9966.41ms. Allocated memory was 195.0MB in the beginning and 299.9MB in the end (delta: 104.9MB). Free memory was 137.0MB in the beginning and 125.5MB in the end (delta: 11.5MB). Peak memory consumption was 147.8MB. Max. memory is 16.1GB. * Witness Printer took 97.80ms. Allocated memory is still 299.9MB. Free memory was 124.4MB in the beginning and 118.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 109 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 935 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 899 mSDsluCounter, 12183 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9747 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1662 IncrementalHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 2436 mSDtfsCounter, 1662 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 599 SyntacticMatches, 4 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=21, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 332 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1232 NumberOfCodeBlocks, 1214 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1291 ConstructedInterpolants, 0 QuantifiedInterpolants, 2496 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1079 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 422/462 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) - ProcedureContractResult [Line: 24]: Procedure Contract for base2flt Derived contract for procedure base2flt. Requires: ((e <= 127) && (0 <= ((long long) 128 + e))) Ensures: ((e <= 127) && (0 <= ((long long) 128 + e))) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:07:37,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE