./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.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 dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:07:53,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:07:53,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:07:53,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:07:53,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:07:53,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:07:53,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:07:53,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:07:53,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:07:53,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:07:53,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:07:53,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:07:53,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:07:53,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:07:53,676 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:07:53,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:07:53,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:07:53,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:07:53,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:07:53,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:07:53,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:07:53,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:07:53,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:07:53,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:07:53,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:07:53,679 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:07:53,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:07:53,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:07:53,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:07:53,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:07:53,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:07:53,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:07:53,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:07:53,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:07:53,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:53,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:07:53,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:07:53,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:07:53,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:07:53,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:07:53,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:07:53,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:07:53,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:07:53,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:07:53,682 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 -> dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 [2024-10-14 20:07:53,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:07:53,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:07:53,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:07:53,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:07:53,887 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:07:53,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2024-10-14 20:07:55,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:07:55,255 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:07:55,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2024-10-14 20:07:55,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6f3e997/3db68ed8ea494e32a520c6d527f1363f/FLAGc54b81fb9 [2024-10-14 20:07:55,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6f3e997/3db68ed8ea494e32a520c6d527f1363f [2024-10-14 20:07:55,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:07:55,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:07:55,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:55,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:07:55,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:07:55,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136495ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55, skipping insertion in model container [2024-10-14 20:07:55,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:07:55,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:55,508 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:07:55,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:55,567 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:07:55,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55 WrapperNode [2024-10-14 20:07:55,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:55,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:55,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:07:55,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:07:55,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,599 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-10-14 20:07:55,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:55,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:07:55,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:07:55,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:07:55,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,626 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 20:07:55,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:07:55,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:07:55,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:07:55,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:07:55,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (1/1) ... [2024-10-14 20:07:55,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:55,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:55,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:07:55,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:07:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:07:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:07:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-14 20:07:55,720 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-14 20:07:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:07:55,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:07:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:07:55,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:07:55,778 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:07:55,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:07:56,167 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-14 20:07:56,167 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:07:56,187 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:07:56,187 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:07:56,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:56 BoogieIcfgContainer [2024-10-14 20:07:56,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:07:56,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:07:56,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:07:56,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:07:56,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:07:55" (1/3) ... [2024-10-14 20:07:56,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eeb3cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:56, skipping insertion in model container [2024-10-14 20:07:56,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:55" (2/3) ... [2024-10-14 20:07:56,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eeb3cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:56, skipping insertion in model container [2024-10-14 20:07:56,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:56" (3/3) ... [2024-10-14 20:07:56,195 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2024-10-14 20:07:56,209 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:07:56,209 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-10-14 20:07:56,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:07:56,265 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;@78db5ec3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:07:56,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-10-14 20:07:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 84 states have (on average 1.7023809523809523) internal successors, (143), 109 states have internal predecessors, (143), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 20:07:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:07:56,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:56,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:56,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2039126722, now seen corresponding path program 1 times [2024-10-14 20:07:56,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:56,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181640336] [2024-10-14 20:07:56,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:56,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:56,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:56,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181640336] [2024-10-14 20:07:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181640336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:56,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:56,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571097145] [2024-10-14 20:07:56,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:56,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:56,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:56,491 INFO L87 Difference]: Start difference. First operand has 116 states, 84 states have (on average 1.7023809523809523) internal successors, (143), 109 states have internal predecessors, (143), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:56,627 INFO L93 Difference]: Finished difference Result 283 states and 397 transitions. [2024-10-14 20:07:56,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:56,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:07:56,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:56,636 INFO L225 Difference]: With dead ends: 283 [2024-10-14 20:07:56,636 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 20:07:56,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:56,641 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 87 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:56,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 363 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 20:07:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 142. [2024-10-14 20:07:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 135 states have internal predecessors, (175), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 183 transitions. [2024-10-14 20:07:56,678 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 183 transitions. Word has length 8 [2024-10-14 20:07:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:56,678 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 183 transitions. [2024-10-14 20:07:56,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 183 transitions. [2024-10-14 20:07:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 20:07:56,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:56,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:56,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:07:56,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:56,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash 89307774, now seen corresponding path program 1 times [2024-10-14 20:07:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:56,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79891138] [2024-10-14 20:07:56,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79891138] [2024-10-14 20:07:56,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79891138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:56,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:56,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:56,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857690269] [2024-10-14 20:07:56,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:56,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:56,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:56,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:56,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:56,737 INFO L87 Difference]: Start difference. First operand 142 states and 183 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:56,802 INFO L93 Difference]: Finished difference Result 294 states and 386 transitions. [2024-10-14 20:07:56,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:56,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 20:07:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:56,808 INFO L225 Difference]: With dead ends: 294 [2024-10-14 20:07:56,809 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 20:07:56,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:56,813 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:56,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 203 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 20:07:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2024-10-14 20:07:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.4916666666666667) internal successors, (179), 139 states have internal predecessors, (179), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2024-10-14 20:07:56,835 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 13 [2024-10-14 20:07:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:56,835 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2024-10-14 20:07:56,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2024-10-14 20:07:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 20:07:56,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:56,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:56,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:07:56,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash 89196428, now seen corresponding path program 1 times [2024-10-14 20:07:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437406862] [2024-10-14 20:07:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:07:56,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:56,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437406862] [2024-10-14 20:07:56,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437406862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:56,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:56,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:56,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541253457] [2024-10-14 20:07:56,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:56,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:56,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:56,890 INFO L87 Difference]: Start difference. First operand 146 states and 187 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:56,938 INFO L93 Difference]: Finished difference Result 146 states and 187 transitions. [2024-10-14 20:07:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 20:07:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:56,940 INFO L225 Difference]: With dead ends: 146 [2024-10-14 20:07:56,940 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 20:07:56,940 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-10-14 20:07:56,941 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:56,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 196 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 20:07:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-10-14 20:07:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 120 states have (on average 1.475) internal successors, (177), 138 states have internal predecessors, (177), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2024-10-14 20:07:56,949 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 13 [2024-10-14 20:07:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:56,949 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2024-10-14 20:07:56,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2024-10-14 20:07:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:07:56,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:56,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:56,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:07:56,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1149817392, now seen corresponding path program 1 times [2024-10-14 20:07:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227196740] [2024-10-14 20:07:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:57,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227196740] [2024-10-14 20:07:57,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227196740] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:57,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957156614] [2024-10-14 20:07:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:57,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:57,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:57,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:07:57,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 20:07:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:57,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:57,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:57,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957156614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:07:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-14 20:07:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246692504] [2024-10-14 20:07:57,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:57,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:57,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:57,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:57,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:07:57,132 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:57,215 INFO L93 Difference]: Finished difference Result 171 states and 225 transitions. [2024-10-14 20:07:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:57,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 20:07:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:57,217 INFO L225 Difference]: With dead ends: 171 [2024-10-14 20:07:57,217 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 20:07:57,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-10-14 20:07:57,218 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 25 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:57,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 283 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 20:07:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2024-10-14 20:07:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.4488188976377954) internal successors, (184), 145 states have internal predecessors, (184), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions. [2024-10-14 20:07:57,235 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 14 [2024-10-14 20:07:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:57,235 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions. [2024-10-14 20:07:57,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions. [2024-10-14 20:07:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:07:57,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:57,238 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:57,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:07:57,439 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-10-14 20:07:57,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:57,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1529877971, now seen corresponding path program 1 times [2024-10-14 20:07:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:57,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272586] [2024-10-14 20:07:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272586] [2024-10-14 20:07:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:57,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214749661] [2024-10-14 20:07:57,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:57,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:57,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:57,497 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-10-14 20:07:57,500 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-10-14 20:07:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:57,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:57,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:57,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214749661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:07:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-14 20:07:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017412348] [2024-10-14 20:07:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:57,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:57,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:57,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:07:57,558 INFO L87 Difference]: Start difference. First operand 152 states and 192 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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-10-14 20:07:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:57,606 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2024-10-14 20:07:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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-10-14 20:07:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:57,607 INFO L225 Difference]: With dead ends: 158 [2024-10-14 20:07:57,607 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 20:07:57,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:07:57,609 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 17 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:57,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 187 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 20:07:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-10-14 20:07:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 129 states have (on average 1.441860465116279) internal successors, (186), 147 states have internal predecessors, (186), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 194 transitions. [2024-10-14 20:07:57,623 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 194 transitions. Word has length 14 [2024-10-14 20:07:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 194 transitions. [2024-10-14 20:07:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) 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-10-14 20:07:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 194 transitions. [2024-10-14 20:07:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:07:57,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:57,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:57,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:07:57,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:57,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:57,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1284600877, now seen corresponding path program 1 times [2024-10-14 20:07:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:57,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211560950] [2024-10-14 20:07:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:57,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 20:07:57,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211560950] [2024-10-14 20:07:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211560950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631942450] [2024-10-14 20:07:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:57,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:57,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:57,848 INFO L87 Difference]: Start difference. First operand 154 states and 194 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-10-14 20:07:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:57,876 INFO L93 Difference]: Finished difference Result 154 states and 194 transitions. [2024-10-14 20:07:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:57,876 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 15 [2024-10-14 20:07:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:57,877 INFO L225 Difference]: With dead ends: 154 [2024-10-14 20:07:57,877 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 20:07:57,878 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-10-14 20:07:57,878 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:57,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 190 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 20:07:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-10-14 20:07:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 144 states have internal predecessors, (182), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2024-10-14 20:07:57,890 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 15 [2024-10-14 20:07:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:57,891 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2024-10-14 20:07:57,891 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-10-14 20:07:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2024-10-14 20:07:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:07:57,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:57,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:57,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:07:57,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:57,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash 546638012, now seen corresponding path program 1 times [2024-10-14 20:07:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:57,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611265579] [2024-10-14 20:07:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611265579] [2024-10-14 20:07:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611265579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:57,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133770063] [2024-10-14 20:07:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:57,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:57,930 INFO L87 Difference]: Start difference. First operand 151 states and 190 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:57,967 INFO L93 Difference]: Finished difference Result 308 states and 393 transitions. [2024-10-14 20:07:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:57,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 20:07:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:57,970 INFO L225 Difference]: With dead ends: 308 [2024-10-14 20:07:57,970 INFO L226 Difference]: Without dead ends: 159 [2024-10-14 20:07:57,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:57,971 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:57,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 201 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-14 20:07:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2024-10-14 20:07:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 146 states have internal predecessors, (182), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2024-10-14 20:07:57,983 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 15 [2024-10-14 20:07:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:57,983 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2024-10-14 20:07:57,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2024-10-14 20:07:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:07:57,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:57,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:57,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:07:57,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:57,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash -72875387, now seen corresponding path program 1 times [2024-10-14 20:07:57,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:57,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243555801] [2024-10-14 20:07:57,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:58,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:58,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243555801] [2024-10-14 20:07:58,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243555801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:58,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:58,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108089590] [2024-10-14 20:07:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:58,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:58,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:58,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:58,046 INFO L87 Difference]: Start difference. First operand 153 states and 190 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:58,145 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2024-10-14 20:07:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:58,146 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 20:07:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:58,147 INFO L225 Difference]: With dead ends: 172 [2024-10-14 20:07:58,147 INFO L226 Difference]: Without dead ends: 170 [2024-10-14 20:07:58,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:07:58,148 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 102 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:58,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 362 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-14 20:07:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2024-10-14 20:07:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 153 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 199 transitions. [2024-10-14 20:07:58,154 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 199 transitions. Word has length 15 [2024-10-14 20:07:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:58,154 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 199 transitions. [2024-10-14 20:07:58,154 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 199 transitions. [2024-10-14 20:07:58,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:07:58,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:58,155 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:58,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:07:58,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:58,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1170084444, now seen corresponding path program 1 times [2024-10-14 20:07:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428387742] [2024-10-14 20:07:58,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:58,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428387742] [2024-10-14 20:07:58,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428387742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:58,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672868638] [2024-10-14 20:07:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:58,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:58,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:58,200 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-10-14 20:07:58,201 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-10-14 20:07:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:58,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:58,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672868638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:07:58,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-14 20:07:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915568246] [2024-10-14 20:07:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:58,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:58,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:58,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:07:58,262 INFO L87 Difference]: Start difference. First operand 160 states and 199 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:58,315 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2024-10-14 20:07:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:58,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 20:07:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:58,317 INFO L225 Difference]: With dead ends: 168 [2024-10-14 20:07:58,317 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 20:07:58,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:07:58,318 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:58,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 288 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 20:07:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-10-14 20:07:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 157 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2024-10-14 20:07:58,326 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 16 [2024-10-14 20:07:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:58,326 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2024-10-14 20:07:58,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2024-10-14 20:07:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:07:58,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:58,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:58,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:07:58,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:58,533 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:58,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1417355705, now seen corresponding path program 1 times [2024-10-14 20:07:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:58,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725532100] [2024-10-14 20:07:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725532100] [2024-10-14 20:07:58,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725532100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:58,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:58,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655159884] [2024-10-14 20:07:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:58,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:58,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:58,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:58,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:58,574 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:58,633 INFO L93 Difference]: Finished difference Result 330 states and 406 transitions. [2024-10-14 20:07:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 20:07:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:58,635 INFO L225 Difference]: With dead ends: 330 [2024-10-14 20:07:58,635 INFO L226 Difference]: Without dead ends: 168 [2024-10-14 20:07:58,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:58,636 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:58,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 305 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-14 20:07:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-14 20:07:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3776223776223777) internal successors, (197), 160 states have internal predecessors, (197), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 205 transitions. [2024-10-14 20:07:58,641 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 205 transitions. Word has length 16 [2024-10-14 20:07:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:58,641 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 205 transitions. [2024-10-14 20:07:58,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:07:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 205 transitions. [2024-10-14 20:07:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:07:58,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:58,642 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:58,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:07:58,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:58,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1239598417, now seen corresponding path program 1 times [2024-10-14 20:07:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:58,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618892362] [2024-10-14 20:07:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:07:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618892362] [2024-10-14 20:07:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618892362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743615839] [2024-10-14 20:07:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:58,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:58,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:58,688 INFO L87 Difference]: Start difference. First operand 168 states and 205 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:07:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:58,781 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2024-10-14 20:07:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:58,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-14 20:07:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:58,784 INFO L225 Difference]: With dead ends: 228 [2024-10-14 20:07:58,784 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 20:07:58,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:07:58,785 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 136 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:58,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 287 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 20:07:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2024-10-14 20:07:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 205 states have internal predecessors, (256), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 264 transitions. [2024-10-14 20:07:58,795 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 264 transitions. Word has length 21 [2024-10-14 20:07:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:58,795 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 264 transitions. [2024-10-14 20:07:58,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:07:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 264 transitions. [2024-10-14 20:07:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:07:58,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:58,795 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:58,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 20:07:58,796 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:58,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1268225773, now seen corresponding path program 1 times [2024-10-14 20:07:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847509295] [2024-10-14 20:07:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:58,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:07:58,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847509295] [2024-10-14 20:07:58,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847509295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:58,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:58,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:58,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870266989] [2024-10-14 20:07:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:58,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:58,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:58,843 INFO L87 Difference]: Start difference. First operand 214 states and 264 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:07:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:58,914 INFO L93 Difference]: Finished difference Result 226 states and 274 transitions. [2024-10-14 20:07:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:58,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-14 20:07:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:58,916 INFO L225 Difference]: With dead ends: 226 [2024-10-14 20:07:58,916 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 20:07:58,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:07:58,917 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 138 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:58,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 290 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 20:07:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 205. [2024-10-14 20:07:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 180 states have (on average 1.35) internal successors, (243), 196 states have internal predecessors, (243), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 251 transitions. [2024-10-14 20:07:58,924 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 251 transitions. Word has length 21 [2024-10-14 20:07:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:58,924 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 251 transitions. [2024-10-14 20:07:58,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:07:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 251 transitions. [2024-10-14 20:07:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 20:07:58,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:58,925 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:58,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 20:07:58,925 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:58,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1360483978, now seen corresponding path program 1 times [2024-10-14 20:07:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923871075] [2024-10-14 20:07:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:58,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:58,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923871075] [2024-10-14 20:07:58,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923871075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:58,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:58,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:58,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738240321] [2024-10-14 20:07:58,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:58,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:58,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:58,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:58,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:58,964 INFO L87 Difference]: Start difference. First operand 205 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 20:07:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:59,007 INFO L93 Difference]: Finished difference Result 360 states and 440 transitions. [2024-10-14 20:07:59,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:59,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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 22 [2024-10-14 20:07:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:59,008 INFO L225 Difference]: With dead ends: 360 [2024-10-14 20:07:59,008 INFO L226 Difference]: Without dead ends: 182 [2024-10-14 20:07:59,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:59,009 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 36 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:59,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 301 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-14 20:07:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2024-10-14 20:07:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 170 states have internal predecessors, (210), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 218 transitions. [2024-10-14 20:07:59,019 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 218 transitions. Word has length 22 [2024-10-14 20:07:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:59,019 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 218 transitions. [2024-10-14 20:07:59,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 20:07:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 218 transitions. [2024-10-14 20:07:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 20:07:59,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:59,019 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:59,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 20:07:59,019 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:59,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1978958687, now seen corresponding path program 1 times [2024-10-14 20:07:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:59,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41947407] [2024-10-14 20:07:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:59,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:07:59,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41947407] [2024-10-14 20:07:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41947407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:59,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:59,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280655507] [2024-10-14 20:07:59,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:59,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:59,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:59,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:59,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:59,054 INFO L87 Difference]: Start difference. First operand 179 states and 218 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 20:07:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:59,117 INFO L93 Difference]: Finished difference Result 347 states and 424 transitions. [2024-10-14 20:07:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:07:59,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 22 [2024-10-14 20:07:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:59,120 INFO L225 Difference]: With dead ends: 347 [2024-10-14 20:07:59,120 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 20:07:59,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:07:59,120 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 70 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:59,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 291 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 20:07:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2024-10-14 20:07:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 182 states have internal predecessors, (224), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-10-14 20:07:59,128 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 22 [2024-10-14 20:07:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:59,129 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-10-14 20:07:59,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 20:07:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-10-14 20:07:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 20:07:59,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:59,131 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:59,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 20:07:59,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:59,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1635481383, now seen corresponding path program 1 times [2024-10-14 20:07:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:59,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068110439] [2024-10-14 20:07:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:59,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:59,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 20:07:59,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:59,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068110439] [2024-10-14 20:07:59,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068110439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:59,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:59,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091405257] [2024-10-14 20:07:59,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:59,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:59,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:59,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:59,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:59,170 INFO L87 Difference]: Start difference. First operand 191 states and 232 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 20:07:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:59,226 INFO L93 Difference]: Finished difference Result 196 states and 239 transitions. [2024-10-14 20:07:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:59,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-14 20:07:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:59,228 INFO L225 Difference]: With dead ends: 196 [2024-10-14 20:07:59,228 INFO L226 Difference]: Without dead ends: 195 [2024-10-14 20:07:59,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:59,230 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:59,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 188 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-14 20:07:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2024-10-14 20:07:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 156 states have (on average 1.358974358974359) internal successors, (212), 172 states have internal predecessors, (212), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 220 transitions. [2024-10-14 20:07:59,241 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 220 transitions. Word has length 27 [2024-10-14 20:07:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:59,241 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 220 transitions. [2024-10-14 20:07:59,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 20:07:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 220 transitions. [2024-10-14 20:07:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 20:07:59,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:59,242 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:59,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 20:07:59,243 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:59,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash -400155202, now seen corresponding path program 1 times [2024-10-14 20:07:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:59,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388326313] [2024-10-14 20:07:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:59,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:07:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 20:07:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:59,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388326313] [2024-10-14 20:07:59,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388326313] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:59,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804942791] [2024-10-14 20:07:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:59,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:59,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:59,365 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-10-14 20:07:59,367 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-10-14 20:07:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:59,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:07:59,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 20:07:59,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:07:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 20:07:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804942791] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:07:59,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:07:59,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-14 20:07:59,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759746413] [2024-10-14 20:07:59,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:07:59,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 20:07:59,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:59,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 20:07:59,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-14 20:07:59,601 INFO L87 Difference]: Start difference. First operand 181 states and 220 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 20:07:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:59,828 INFO L93 Difference]: Finished difference Result 635 states and 809 transitions. [2024-10-14 20:07:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 20:07:59,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2024-10-14 20:07:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:59,831 INFO L225 Difference]: With dead ends: 635 [2024-10-14 20:07:59,832 INFO L226 Difference]: Without dead ends: 488 [2024-10-14 20:07:59,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2024-10-14 20:07:59,833 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 244 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:59,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 502 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:07:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-14 20:07:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 201. [2024-10-14 20:07:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.3409090909090908) internal successors, (236), 192 states have internal predecessors, (236), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 244 transitions. [2024-10-14 20:07:59,845 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 244 transitions. Word has length 40 [2024-10-14 20:07:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:59,845 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 244 transitions. [2024-10-14 20:07:59,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 20:07:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 244 transitions. [2024-10-14 20:07:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 20:07:59,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:59,846 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-10-14 20:07:59,859 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-10-14 20:08:00,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 20:08:00,048 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:00,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash 602829493, now seen corresponding path program 1 times [2024-10-14 20:08:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553692915] [2024-10-14 20:08:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 20:08:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:08:00,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:00,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553692915] [2024-10-14 20:08:00,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553692915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:00,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:00,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:08:00,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485878217] [2024-10-14 20:08:00,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:00,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:08:00,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:00,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:08:00,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:08:00,098 INFO L87 Difference]: Start difference. First operand 201 states and 244 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:08:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:00,175 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2024-10-14 20:08:00,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:08:00,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-14 20:08:00,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:00,177 INFO L225 Difference]: With dead ends: 204 [2024-10-14 20:08:00,177 INFO L226 Difference]: Without dead ends: 201 [2024-10-14 20:08:00,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:08:00,177 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 127 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:00,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 309 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:08:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-14 20:08:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2024-10-14 20:08:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 169 states have (on average 1.3254437869822486) internal successors, (224), 182 states have internal predecessors, (224), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:08:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-10-14 20:08:00,197 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 43 [2024-10-14 20:08:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:00,198 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-10-14 20:08:00,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:08:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-10-14 20:08:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 20:08:00,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:00,199 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 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] [2024-10-14 20:08:00,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 20:08:00,199 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:00,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:00,199 INFO L85 PathProgramCache]: Analyzing trace with hash 574202137, now seen corresponding path program 1 times [2024-10-14 20:08:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:00,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471643090] [2024-10-14 20:08:00,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:00,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 20:08:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:08:00,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:00,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471643090] [2024-10-14 20:08:00,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471643090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:00,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:00,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:08:00,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572469594] [2024-10-14 20:08:00,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:00,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:08:00,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:00,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:08:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:08:00,244 INFO L87 Difference]: Start difference. First operand 191 states and 232 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:08:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:00,317 INFO L93 Difference]: Finished difference Result 198 states and 240 transitions. [2024-10-14 20:08:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:08:00,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-14 20:08:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:00,318 INFO L225 Difference]: With dead ends: 198 [2024-10-14 20:08:00,318 INFO L226 Difference]: Without dead ends: 196 [2024-10-14 20:08:00,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:08:00,319 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 135 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:00,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 304 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:08:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-14 20:08:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 180. [2024-10-14 20:08:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.325) internal successors, (212), 171 states have internal predecessors, (212), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:08:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 220 transitions. [2024-10-14 20:08:00,328 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 220 transitions. Word has length 43 [2024-10-14 20:08:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:00,328 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 220 transitions. [2024-10-14 20:08:00,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:08:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 220 transitions. [2024-10-14 20:08:00,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 20:08:00,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:00,329 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 20:08:00,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 20:08:00,329 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:00,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:00,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1653078402, now seen corresponding path program 1 times [2024-10-14 20:08:00,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:00,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288683751] [2024-10-14 20:08:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:00,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 20:08:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:00,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288683751] [2024-10-14 20:08:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288683751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:00,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:00,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:08:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681527638] [2024-10-14 20:08:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:00,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:08:00,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:00,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:08:00,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:08:00,390 INFO L87 Difference]: Start difference. First operand 180 states and 220 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:08:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:00,444 INFO L93 Difference]: Finished difference Result 334 states and 410 transitions. [2024-10-14 20:08:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:08:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-14 20:08:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:00,445 INFO L225 Difference]: With dead ends: 334 [2024-10-14 20:08:00,445 INFO L226 Difference]: Without dead ends: 200 [2024-10-14 20:08:00,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:08:00,446 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 9 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:00,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 284 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:08:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-14 20:08:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2024-10-14 20:08:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.314102564102564) internal successors, (205), 167 states have internal predecessors, (205), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:08:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 213 transitions. [2024-10-14 20:08:00,456 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 213 transitions. Word has length 44 [2024-10-14 20:08:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:00,456 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 213 transitions. [2024-10-14 20:08:00,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:08:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 213 transitions. [2024-10-14 20:08:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 20:08:00,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:00,457 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 20:08:00,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 20:08:00,457 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:00,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:00,458 INFO L85 PathProgramCache]: Analyzing trace with hash -651337579, now seen corresponding path program 1 times [2024-10-14 20:08:00,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:00,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869138200] [2024-10-14 20:08:00,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:00,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869138200] [2024-10-14 20:08:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869138200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:00,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:08:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027836388] [2024-10-14 20:08:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:00,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:08:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:00,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:08:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:08:00,555 INFO L87 Difference]: Start difference. First operand 176 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:08:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:00,640 INFO L93 Difference]: Finished difference Result 382 states and 462 transitions. [2024-10-14 20:08:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:08:00,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-14 20:08:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:00,641 INFO L225 Difference]: With dead ends: 382 [2024-10-14 20:08:00,642 INFO L226 Difference]: Without dead ends: 249 [2024-10-14 20:08:00,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:08:00,643 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 52 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:00,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 248 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:08:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-14 20:08:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 176. [2024-10-14 20:08:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 167 states have internal predecessors, (204), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:08:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2024-10-14 20:08:00,656 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 45 [2024-10-14 20:08:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:00,656 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2024-10-14 20:08:00,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 20:08:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2024-10-14 20:08:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 20:08:00,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:00,657 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2024-10-14 20:08:00,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 20:08:00,657 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:00,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1296258099, now seen corresponding path program 1 times [2024-10-14 20:08:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:00,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818257569] [2024-10-14 20:08:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:00,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818257569] [2024-10-14 20:08:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818257569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:08:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601724925] [2024-10-14 20:08:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:00,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:00,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:08:00,804 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-10-14 20:08:00,805 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-10-14 20:08:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:00,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 20:08:00,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:08:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:01,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:08:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601724925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:08:01,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:08:01,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-10-14 20:08:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210886122] [2024-10-14 20:08:01,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:08:01,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 20:08:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:01,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 20:08:01,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-10-14 20:08:01,410 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:08:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:01,950 INFO L93 Difference]: Finished difference Result 484 states and 584 transitions. [2024-10-14 20:08:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 20:08:01,951 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-10-14 20:08:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:01,952 INFO L225 Difference]: With dead ends: 484 [2024-10-14 20:08:01,952 INFO L226 Difference]: Without dead ends: 336 [2024-10-14 20:08:01,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=373, Unknown=0, NotChecked=0, Total=600 [2024-10-14 20:08:01,953 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 123 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:01,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 780 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:08:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-14 20:08:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 176. [2024-10-14 20:08:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.2820512820512822) internal successors, (200), 167 states have internal predecessors, (200), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:08:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2024-10-14 20:08:01,965 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 50 [2024-10-14 20:08:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:01,965 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2024-10-14 20:08:01,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:08:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2024-10-14 20:08:01,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 20:08:01,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:01,966 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 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] [2024-10-14 20:08:01,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 20:08:02,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:02,171 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:02,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1454208409, now seen corresponding path program 1 times [2024-10-14 20:08:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979315478] [2024-10-14 20:08:02,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:02,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:02,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979315478] [2024-10-14 20:08:02,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979315478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:08:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058360194] [2024-10-14 20:08:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:08:02,323 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-10-14 20:08:02,325 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-10-14 20:08:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:02,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 20:08:02,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:08:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:02,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:08:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058360194] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:08:02,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:08:02,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-10-14 20:08:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551528051] [2024-10-14 20:08:02,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:08:02,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 20:08:02,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:02,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 20:08:02,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2024-10-14 20:08:02,662 INFO L87 Difference]: Start difference. First operand 176 states and 208 transitions. Second operand has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:08:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:03,048 INFO L93 Difference]: Finished difference Result 952 states and 1190 transitions. [2024-10-14 20:08:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 20:08:03,049 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2024-10-14 20:08:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:03,051 INFO L225 Difference]: With dead ends: 952 [2024-10-14 20:08:03,051 INFO L226 Difference]: Without dead ends: 830 [2024-10-14 20:08:03,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2024-10-14 20:08:03,052 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 421 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:03,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 798 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:08:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-14 20:08:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 216. [2024-10-14 20:08:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 196 states have (on average 1.2653061224489797) internal successors, (248), 207 states have internal predecessors, (248), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:08:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 256 transitions. [2024-10-14 20:08:03,067 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 256 transitions. Word has length 61 [2024-10-14 20:08:03,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:03,067 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 256 transitions. [2024-10-14 20:08:03,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:08:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 256 transitions. [2024-10-14 20:08:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 20:08:03,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:03,068 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 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] [2024-10-14 20:08:03,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 20:08:03,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:03,269 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:03,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:03,269 INFO L85 PathProgramCache]: Analyzing trace with hash -223107635, now seen corresponding path program 2 times [2024-10-14 20:08:03,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:03,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942863357] [2024-10-14 20:08:03,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:03,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 17 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942863357] [2024-10-14 20:08:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942863357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:08:03,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165304495] [2024-10-14 20:08:03,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:08:03,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:03,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:08:03,612 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-10-14 20:08:03,614 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-10-14 20:08:03,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:08:03,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:08:03,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 20:08:03,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:08:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 17 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:04,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:08:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 17 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:06,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165304495] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:08:06,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:08:06,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 41 [2024-10-14 20:08:06,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156122473] [2024-10-14 20:08:06,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:08:06,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 20:08:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:06,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 20:08:06,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 20:08:06,178 INFO L87 Difference]: Start difference. First operand 216 states and 256 transitions. Second operand has 41 states, 41 states have (on average 3.5609756097560976) internal successors, (146), 41 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:08:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:10,892 INFO L93 Difference]: Finished difference Result 674 states and 810 transitions. [2024-10-14 20:08:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-14 20:08:10,892 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.5609756097560976) internal successors, (146), 41 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2024-10-14 20:08:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:10,894 INFO L225 Difference]: With dead ends: 674 [2024-10-14 20:08:10,894 INFO L226 Difference]: Without dead ends: 524 [2024-10-14 20:08:10,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=951, Invalid=2019, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 20:08:10,895 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 390 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:10,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1439 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 20:08:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-14 20:08:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 216. [2024-10-14 20:08:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 196 states have (on average 1.2244897959183674) internal successors, (240), 207 states have internal predecessors, (240), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:08:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 248 transitions. [2024-10-14 20:08:10,910 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 248 transitions. Word has length 70 [2024-10-14 20:08:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:10,911 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 248 transitions. [2024-10-14 20:08:10,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.5609756097560976) internal successors, (146), 41 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:08:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 248 transitions. [2024-10-14 20:08:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 20:08:10,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:10,911 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 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] [2024-10-14 20:08:10,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 20:08:11,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:11,116 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:11,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2082472345, now seen corresponding path program 2 times [2024-10-14 20:08:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474204636] [2024-10-14 20:08:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:11,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 8 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:11,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:11,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474204636] [2024-10-14 20:08:11,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474204636] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:08:11,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284459880] [2024-10-14 20:08:11,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:08:11,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:11,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:08:11,464 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-10-14 20:08:11,465 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-10-14 20:08:11,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:08:11,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:08:11,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 20:08:11,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:08:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 8 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:11,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:08:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 8 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:12,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284459880] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:08:12,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:08:12,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2024-10-14 20:08:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488181151] [2024-10-14 20:08:12,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:08:12,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 20:08:12,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:12,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 20:08:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 20:08:12,355 INFO L87 Difference]: Start difference. First operand 216 states and 248 transitions. Second operand has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:08:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:13,018 INFO L93 Difference]: Finished difference Result 1672 states and 2102 transitions. [2024-10-14 20:08:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-14 20:08:13,019 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 101 [2024-10-14 20:08:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:13,022 INFO L225 Difference]: With dead ends: 1672 [2024-10-14 20:08:13,022 INFO L226 Difference]: Without dead ends: 1550 [2024-10-14 20:08:13,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2024-10-14 20:08:13,024 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1389 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:13,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 746 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:08:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2024-10-14 20:08:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 296. [2024-10-14 20:08:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 276 states have (on average 1.2173913043478262) internal successors, (336), 287 states have internal predecessors, (336), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:08:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 344 transitions. [2024-10-14 20:08:13,045 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 344 transitions. Word has length 101 [2024-10-14 20:08:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:13,045 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 344 transitions. [2024-10-14 20:08:13,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:08:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 344 transitions. [2024-10-14 20:08:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 20:08:13,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:13,046 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 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] [2024-10-14 20:08:13,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 20:08:13,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-14 20:08:13,251 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:13,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -144795187, now seen corresponding path program 3 times [2024-10-14 20:08:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:13,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275172464] [2024-10-14 20:08:13,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:13,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:13,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 17 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:13,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:13,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275172464] [2024-10-14 20:08:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275172464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:08:13,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834630306] [2024-10-14 20:08:13,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:08:13,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:13,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:08:13,857 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-10-14 20:08:13,858 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-10-14 20:08:14,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-10-14 20:08:14,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:08:14,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-14 20:08:14,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:08:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 17 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:16,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:08:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 17 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:08:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834630306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:08:25,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:08:25,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 33] total 80 [2024-10-14 20:08:25,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87725] [2024-10-14 20:08:25,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:08:25,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-10-14 20:08:25,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:25,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-10-14 20:08:25,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=4657, Unknown=0, NotChecked=0, Total=6320 [2024-10-14 20:08:25,457 INFO L87 Difference]: Start difference. First operand 296 states and 344 transitions. Second operand has 80 states, 80 states have (on average 3.3125) internal successors, (265), 80 states have internal predecessors, (265), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:09:13,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:09:22,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []