./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:55:54,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:55:54,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 12:55:54,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:55:54,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:55:54,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:55:54,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:55:54,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:55:54,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:55:54,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:55:54,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:55:54,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:55:54,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:55:54,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:55:54,272 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:55:54,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:55:54,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 12:55:54,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:55:54,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:55:54,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:55:54,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:55:54,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 12:55:54,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:55:54,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 12:55:54,275 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:55:54,275 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 12:55:54,275 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:55:54,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:55:54,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 12:55:54,276 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:55:54,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:55:54,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:55:54,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:55:54,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:55:54,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:55:54,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:55:54,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:55:54,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 12:55:54,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:55:54,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:55:54,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:55:54,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:55:54,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:55:54,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:55:54,284 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-13 12:55:54,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:55:54,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:55:54,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:55:54,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:55:54,564 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:55:54,565 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-13 12:55:55,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:55:56,192 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:55:56,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2024-10-13 12:55:56,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3ec2e1c/529855f7c91a438486ace0646cd116ae/FLAGc5b3dea7f [2024-10-13 12:55:56,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3ec2e1c/529855f7c91a438486ace0646cd116ae [2024-10-13 12:55:56,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:55:56,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:55:56,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:55:56,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:55:56,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:55:56,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f30d82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56, skipping insertion in model container [2024-10-13 12:55:56,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:55:56,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:55:56,501 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:55:56,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:55:56,555 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:55:56,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56 WrapperNode [2024-10-13 12:55:56,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:55:56,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:55:56,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:55:56,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:55:56,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,596 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-10-13 12:55:56,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:55:56,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:55:56,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:55:56,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:55:56,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,627 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-13 12:55:56,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:55:56,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:55:56,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:55:56,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:55:56,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (1/1) ... [2024-10-13 12:55:56,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:55:56,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:56,685 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-13 12:55:56,692 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-13 12:55:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:55:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:55:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-13 12:55:56,741 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-13 12:55:56,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:55:56,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:55:56,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 12:55:56,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 12:55:56,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:55:56,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:55:57,289 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-13 12:55:57,289 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:55:57,325 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:55:57,326 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:55:57,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:57 BoogieIcfgContainer [2024-10-13 12:55:57,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:55:57,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:55:57,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:55:57,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:55:57,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:55:56" (1/3) ... [2024-10-13 12:55:57,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f037490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:55:57, skipping insertion in model container [2024-10-13 12:55:57,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:56" (2/3) ... [2024-10-13 12:55:57,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f037490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:55:57, skipping insertion in model container [2024-10-13 12:55:57,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:57" (3/3) ... [2024-10-13 12:55:57,337 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2024-10-13 12:55:57,355 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:55:57,355 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-10-13 12:55:57,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:55:57,437 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;@791a8bd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:55:57,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-10-13 12:55:57,443 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-13 12:55:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 12:55:57,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:57,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:57,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:55:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2039126722, now seen corresponding path program 1 times [2024-10-13 12:55:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579762407] [2024-10-13 12:55:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,749 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-13 12:55:57,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:57,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579762407] [2024-10-13 12:55:57,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579762407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:57,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:57,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:57,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870723104] [2024-10-13 12:55:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:57,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:57,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:57,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:57,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:57,776 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-13 12:55:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:57,924 INFO L93 Difference]: Finished difference Result 283 states and 397 transitions. [2024-10-13 12:55:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:57,926 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-13 12:55:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:57,935 INFO L225 Difference]: With dead ends: 283 [2024-10-13 12:55:57,935 INFO L226 Difference]: Without dead ends: 153 [2024-10-13 12:55:57,938 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-13 12:55:57,941 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-13 12:55:57,942 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-13 12:55:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-13 12:55:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 142. [2024-10-13 12:55:57,978 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-13 12:55:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 183 transitions. [2024-10-13 12:55:57,983 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 183 transitions. Word has length 8 [2024-10-13 12:55:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:57,984 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 183 transitions. [2024-10-13 12:55:57,984 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-13 12:55:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 183 transitions. [2024-10-13 12:55:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 12:55:57,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:57,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:57,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:55:57,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:55:57,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash 89307774, now seen corresponding path program 1 times [2024-10-13 12:55:57,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:57,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908773924] [2024-10-13 12:55:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:57,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,073 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-13 12:55:58,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:58,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908773924] [2024-10-13 12:55:58,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908773924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:58,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:58,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059548130] [2024-10-13 12:55:58,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:58,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:58,077 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-13 12:55:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:58,152 INFO L93 Difference]: Finished difference Result 294 states and 386 transitions. [2024-10-13 12:55:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:58,153 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-13 12:55:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:58,154 INFO L225 Difference]: With dead ends: 294 [2024-10-13 12:55:58,154 INFO L226 Difference]: Without dead ends: 154 [2024-10-13 12:55:58,156 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-13 12:55:58,157 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:58,157 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.1s Time] [2024-10-13 12:55:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-13 12:55:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2024-10-13 12:55:58,169 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-13 12:55:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2024-10-13 12:55:58,171 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 13 [2024-10-13 12:55:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:58,172 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2024-10-13 12:55:58,172 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-13 12:55:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2024-10-13 12:55:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 12:55:58,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:58,173 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:58,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:55:58,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:55:58,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:58,174 INFO L85 PathProgramCache]: Analyzing trace with hash 89196428, now seen corresponding path program 1 times [2024-10-13 12:55:58,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:58,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886292372] [2024-10-13 12:55:58,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,226 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-13 12:55:58,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886292372] [2024-10-13 12:55:58,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886292372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:58,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:58,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:55:58,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645383118] [2024-10-13 12:55:58,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:58,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:58,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:58,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:58,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:58,228 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-13 12:55:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:58,285 INFO L93 Difference]: Finished difference Result 146 states and 187 transitions. [2024-10-13 12:55:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:58,289 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-13 12:55:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:58,293 INFO L225 Difference]: With dead ends: 146 [2024-10-13 12:55:58,293 INFO L226 Difference]: Without dead ends: 145 [2024-10-13 12:55:58,293 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-13 12:55:58,294 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-13 12:55:58,295 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-13 12:55:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-13 12:55:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-10-13 12:55:58,309 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-13 12:55:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2024-10-13 12:55:58,312 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 13 [2024-10-13 12:55:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:58,316 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2024-10-13 12:55:58,316 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-13 12:55:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2024-10-13 12:55:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:55:58,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:58,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:58,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:55:58,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:55:58,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1149817392, now seen corresponding path program 1 times [2024-10-13 12:55:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868911734] [2024-10-13 12:55:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,405 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-13 12:55:58,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:58,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868911734] [2024-10-13 12:55:58,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868911734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:58,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651795972] [2024-10-13 12:55:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:58,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:58,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:58,408 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-13 12:55:58,409 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-13 12:55:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:55:58,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:58,540 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-13 12:55:58,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:58,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651795972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:58,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:58,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 12:55:58,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797917895] [2024-10-13 12:55:58,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:58,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:58,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:58,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:58,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:58,542 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-13 12:55:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:58,628 INFO L93 Difference]: Finished difference Result 171 states and 225 transitions. [2024-10-13 12:55:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:58,632 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-13 12:55:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:58,633 INFO L225 Difference]: With dead ends: 171 [2024-10-13 12:55:58,633 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 12:55:58,635 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-13 12:55:58,637 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 25 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 12:55:58,640 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-13 12:55:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 12:55:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2024-10-13 12:55:58,653 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-13 12:55:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions. [2024-10-13 12:55:58,655 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 14 [2024-10-13 12:55:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:58,655 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions. [2024-10-13 12:55:58,655 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-13 12:55:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions. [2024-10-13 12:55:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:55:58,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:58,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:58,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:55:58,857 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-13 12:55:58,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:55:58,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:58,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1529877971, now seen corresponding path program 1 times [2024-10-13 12:55:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303332393] [2024-10-13 12:55:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,950 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-13 12:55:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303332393] [2024-10-13 12:55:58,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303332393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:58,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970129558] [2024-10-13 12:55:58,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:58,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:58,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:58,953 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-13 12:55:58,965 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-13 12:55:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:55:59,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:59,017 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-13 12:55:59,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:59,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970129558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:59,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:59,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 12:55:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995351881] [2024-10-13 12:55:59,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:59,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:59,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:59,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:59,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:55:59,020 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-13 12:55:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:59,072 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2024-10-13 12:55:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:59,072 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-13 12:55:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:59,073 INFO L225 Difference]: With dead ends: 158 [2024-10-13 12:55:59,073 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 12:55:59,074 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-13 12:55:59,075 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-13 12:55:59,075 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-13 12:55:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 12:55:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-10-13 12:55:59,086 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-13 12:55:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 194 transitions. [2024-10-13 12:55:59,087 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 194 transitions. Word has length 14 [2024-10-13 12:55:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:59,087 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 194 transitions. [2024-10-13 12:55:59,087 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-13 12:55:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 194 transitions. [2024-10-13 12:55:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:55:59,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:59,089 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:59,103 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-13 12:55:59,289 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-13 12:55:59,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:55:59,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1284600877, now seen corresponding path program 1 times [2024-10-13 12:55:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787253343] [2024-10-13 12:55:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:59,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,316 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-13 12:55:59,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787253343] [2024-10-13 12:55:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787253343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:59,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:55:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202656750] [2024-10-13 12:55:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:59,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:59,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:59,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:59,319 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-13 12:55:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:59,384 INFO L93 Difference]: Finished difference Result 154 states and 194 transitions. [2024-10-13 12:55:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:59,385 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-13 12:55:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:59,386 INFO L225 Difference]: With dead ends: 154 [2024-10-13 12:55:59,386 INFO L226 Difference]: Without dead ends: 153 [2024-10-13 12:55:59,387 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-13 12:55:59,388 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:59,389 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.1s Time] [2024-10-13 12:55:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-13 12:55:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-10-13 12:55:59,396 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-13 12:55:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2024-10-13 12:55:59,397 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 15 [2024-10-13 12:55:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:59,398 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2024-10-13 12:55:59,398 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-13 12:55:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2024-10-13 12:55:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:55:59,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:59,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:59,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:55:59,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:55:59,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash 546638012, now seen corresponding path program 1 times [2024-10-13 12:55:59,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:59,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746741896] [2024-10-13 12:55:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,438 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-13 12:55:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746741896] [2024-10-13 12:55:59,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746741896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:59,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:59,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339581267] [2024-10-13 12:55:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:59,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:59,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:59,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:59,441 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-13 12:55:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:59,486 INFO L93 Difference]: Finished difference Result 308 states and 393 transitions. [2024-10-13 12:55:59,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:59,486 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-13 12:55:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:59,489 INFO L225 Difference]: With dead ends: 308 [2024-10-13 12:55:59,490 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 12:55:59,491 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-13 12:55:59,494 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-13 12:55:59,494 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-13 12:55:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 12:55:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2024-10-13 12:55:59,508 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-13 12:55:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2024-10-13 12:55:59,512 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 15 [2024-10-13 12:55:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:59,512 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2024-10-13 12:55:59,512 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-13 12:55:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2024-10-13 12:55:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:55:59,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:59,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:55:59,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:55:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash -72875387, now seen corresponding path program 1 times [2024-10-13 12:55:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:59,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599257590] [2024-10-13 12:55:59,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,590 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-13 12:55:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:59,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599257590] [2024-10-13 12:55:59,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599257590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:59,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:59,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:59,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856367359] [2024-10-13 12:55:59,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:59,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:59,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:59,594 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-13 12:55:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:59,708 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2024-10-13 12:55:59,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:59,708 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-13 12:55:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:59,710 INFO L225 Difference]: With dead ends: 172 [2024-10-13 12:55:59,710 INFO L226 Difference]: Without dead ends: 170 [2024-10-13 12:55:59,710 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-13 12:55:59,711 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-13 12:55:59,711 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-13 12:55:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-13 12:55:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2024-10-13 12:55:59,718 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-13 12:55:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 199 transitions. [2024-10-13 12:55:59,719 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 199 transitions. Word has length 15 [2024-10-13 12:55:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:59,720 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 199 transitions. [2024-10-13 12:55:59,720 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-13 12:55:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 199 transitions. [2024-10-13 12:55:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 12:55:59,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:59,722 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:59,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:55:59,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:55:59,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1170084444, now seen corresponding path program 1 times [2024-10-13 12:55:59,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:59,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904645389] [2024-10-13 12:55:59,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:59,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,792 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-13 12:55:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904645389] [2024-10-13 12:55:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904645389] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:59,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656397785] [2024-10-13 12:55:59,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:59,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:59,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:59,795 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-13 12:55:59,797 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-13 12:55:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:55:59,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:59,861 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-13 12:55:59,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:59,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656397785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:59,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:59,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 12:55:59,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198103234] [2024-10-13 12:55:59,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:59,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:59,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:59,863 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-13 12:55:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:59,927 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2024-10-13 12:55:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:59,927 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-13 12:55:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:59,928 INFO L225 Difference]: With dead ends: 168 [2024-10-13 12:55:59,928 INFO L226 Difference]: Without dead ends: 167 [2024-10-13 12:55:59,929 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-13 12:55:59,929 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:59,929 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.1s Time] [2024-10-13 12:55:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-13 12:55:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-10-13 12:55:59,934 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-13 12:55:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2024-10-13 12:55:59,935 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 16 [2024-10-13 12:55:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:59,935 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2024-10-13 12:55:59,935 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-13 12:55:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2024-10-13 12:55:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 12:55:59,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:59,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:59,953 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-13 12:56:00,137 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-13 12:56:00,137 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:00,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1417355705, now seen corresponding path program 1 times [2024-10-13 12:56:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:00,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940577032] [2024-10-13 12:56:00,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,189 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-13 12:56:00,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:00,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940577032] [2024-10-13 12:56:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940577032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:00,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:00,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:56:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332842792] [2024-10-13 12:56:00,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:00,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:56:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:00,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:56:00,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:56:00,191 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-13 12:56:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:00,238 INFO L93 Difference]: Finished difference Result 330 states and 406 transitions. [2024-10-13 12:56:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:56:00,239 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-13 12:56:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:00,240 INFO L225 Difference]: With dead ends: 330 [2024-10-13 12:56:00,240 INFO L226 Difference]: Without dead ends: 168 [2024-10-13 12:56:00,241 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-13 12:56:00,242 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-13 12:56:00,242 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-13 12:56:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-13 12:56:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-13 12:56:00,250 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-13 12:56:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 205 transitions. [2024-10-13 12:56:00,251 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 205 transitions. Word has length 16 [2024-10-13 12:56:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:00,252 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 205 transitions. [2024-10-13 12:56:00,252 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-13 12:56:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 205 transitions. [2024-10-13 12:56:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 12:56:00,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:00,253 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:00,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:56:00,253 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:00,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1239598417, now seen corresponding path program 1 times [2024-10-13 12:56:00,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:00,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620894494] [2024-10-13 12:56:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,328 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-13 12:56:00,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:00,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620894494] [2024-10-13 12:56:00,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620894494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:00,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:00,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:56:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696421475] [2024-10-13 12:56:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:00,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:56:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:56:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:56:00,334 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-13 12:56:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:00,443 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2024-10-13 12:56:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:56:00,444 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-13 12:56:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:00,445 INFO L225 Difference]: With dead ends: 228 [2024-10-13 12:56:00,445 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 12:56:00,445 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-13 12:56:00,446 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-13 12:56:00,446 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-13 12:56:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 12:56:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2024-10-13 12:56:00,456 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-13 12:56:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 264 transitions. [2024-10-13 12:56:00,457 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 264 transitions. Word has length 21 [2024-10-13 12:56:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:00,457 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 264 transitions. [2024-10-13 12:56:00,458 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-13 12:56:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 264 transitions. [2024-10-13 12:56:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 12:56:00,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:00,458 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:00,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:56:00,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:00,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1268225773, now seen corresponding path program 1 times [2024-10-13 12:56:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:00,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760609903] [2024-10-13 12:56:00,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:00,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,530 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-13 12:56:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:00,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760609903] [2024-10-13 12:56:00,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760609903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:00,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:00,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:56:00,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862865847] [2024-10-13 12:56:00,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:00,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:56:00,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:00,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:56:00,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:56:00,534 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-13 12:56:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:00,622 INFO L93 Difference]: Finished difference Result 226 states and 274 transitions. [2024-10-13 12:56:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:56:00,622 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-13 12:56:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:00,623 INFO L225 Difference]: With dead ends: 226 [2024-10-13 12:56:00,623 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 12:56:00,624 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-13 12:56:00,624 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 138 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 12:56:00,625 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-13 12:56:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 12:56:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 205. [2024-10-13 12:56:00,632 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-13 12:56:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 251 transitions. [2024-10-13 12:56:00,633 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 251 transitions. Word has length 21 [2024-10-13 12:56:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:00,633 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 251 transitions. [2024-10-13 12:56:00,633 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-13 12:56:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 251 transitions. [2024-10-13 12:56:00,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 12:56:00,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:00,634 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-13 12:56:00,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 12:56:00,634 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:00,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1360483978, now seen corresponding path program 1 times [2024-10-13 12:56:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:00,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602909184] [2024-10-13 12:56:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,687 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-13 12:56:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:00,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602909184] [2024-10-13 12:56:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602909184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:56:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260497472] [2024-10-13 12:56:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:00,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:56:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:56:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:56:00,689 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-13 12:56:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:00,752 INFO L93 Difference]: Finished difference Result 360 states and 440 transitions. [2024-10-13 12:56:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:56:00,753 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-13 12:56:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:00,754 INFO L225 Difference]: With dead ends: 360 [2024-10-13 12:56:00,754 INFO L226 Difference]: Without dead ends: 182 [2024-10-13 12:56:00,754 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-13 12:56:00,756 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-13 12:56:00,756 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-13 12:56:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-13 12:56:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2024-10-13 12:56:00,763 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-13 12:56:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 218 transitions. [2024-10-13 12:56:00,764 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 218 transitions. Word has length 22 [2024-10-13 12:56:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:00,764 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 218 transitions. [2024-10-13 12:56:00,765 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-13 12:56:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 218 transitions. [2024-10-13 12:56:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 12:56:00,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:00,765 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-13 12:56:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:56:00,765 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:00,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1978958687, now seen corresponding path program 1 times [2024-10-13 12:56:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459581148] [2024-10-13 12:56:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,812 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-13 12:56:00,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:00,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459581148] [2024-10-13 12:56:00,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459581148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:00,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:00,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:56:00,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564931837] [2024-10-13 12:56:00,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:00,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:56:00,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:00,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:56:00,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:56:00,814 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-13 12:56:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:00,891 INFO L93 Difference]: Finished difference Result 347 states and 424 transitions. [2024-10-13 12:56:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:56:00,892 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-13 12:56:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:00,893 INFO L225 Difference]: With dead ends: 347 [2024-10-13 12:56:00,893 INFO L226 Difference]: Without dead ends: 199 [2024-10-13 12:56:00,893 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-13 12:56:00,894 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:00,894 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.1s Time] [2024-10-13 12:56:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-13 12:56:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2024-10-13 12:56:00,902 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-13 12:56:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-10-13 12:56:00,903 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 22 [2024-10-13 12:56:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:00,903 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-10-13 12:56:00,903 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-13 12:56:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-10-13 12:56:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 12:56:00,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:00,904 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-13 12:56:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:56:00,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:00,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1635481383, now seen corresponding path program 1 times [2024-10-13 12:56:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:00,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727123781] [2024-10-13 12:56:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,942 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-13 12:56:00,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727123781] [2024-10-13 12:56:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727123781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:56:00,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693601974] [2024-10-13 12:56:00,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:00,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:56:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:56:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:56:00,946 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-13 12:56:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:00,991 INFO L93 Difference]: Finished difference Result 196 states and 239 transitions. [2024-10-13 12:56:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:56:00,992 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-13 12:56:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:00,993 INFO L225 Difference]: With dead ends: 196 [2024-10-13 12:56:00,993 INFO L226 Difference]: Without dead ends: 195 [2024-10-13 12:56:00,993 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-13 12:56:00,994 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-13 12:56:00,994 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-13 12:56:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-13 12:56:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2024-10-13 12:56:01,001 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-13 12:56:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 220 transitions. [2024-10-13 12:56:01,002 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 220 transitions. Word has length 27 [2024-10-13 12:56:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:01,002 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 220 transitions. [2024-10-13 12:56:01,002 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-13 12:56:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 220 transitions. [2024-10-13 12:56:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 12:56:01,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:01,003 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-13 12:56:01,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 12:56:01,003 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:01,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash -400155202, now seen corresponding path program 1 times [2024-10-13 12:56:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111259339] [2024-10-13 12:56:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 12:56:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,101 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-13 12:56:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111259339] [2024-10-13 12:56:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111259339] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:56:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793639212] [2024-10-13 12:56:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:01,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:01,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:56:01,103 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-13 12:56:01,104 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-13 12:56:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:56:01,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:56:01,224 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-13 12:56:01,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:56:01,378 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-13 12:56:01,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793639212] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:56:01,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:56:01,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-13 12:56:01,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69722410] [2024-10-13 12:56:01,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:56:01,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:56:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:56:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:56:01,381 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-13 12:56:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:01,673 INFO L93 Difference]: Finished difference Result 635 states and 809 transitions. [2024-10-13 12:56:01,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 12:56:01,673 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-13 12:56:01,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:01,676 INFO L225 Difference]: With dead ends: 635 [2024-10-13 12:56:01,676 INFO L226 Difference]: Without dead ends: 488 [2024-10-13 12:56:01,676 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-13 12:56:01,677 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 244 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-13 12:56:01,677 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-13 12:56:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-13 12:56:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 201. [2024-10-13 12:56:01,689 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-13 12:56:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 244 transitions. [2024-10-13 12:56:01,690 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 244 transitions. Word has length 40 [2024-10-13 12:56:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:01,691 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 244 transitions. [2024-10-13 12:56:01,691 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-13 12:56:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 244 transitions. [2024-10-13 12:56:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 12:56:01,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:01,692 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-13 12:56:01,709 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-13 12:56:01,892 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-13 12:56:01,893 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:01,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash 602829493, now seen corresponding path program 1 times [2024-10-13 12:56:01,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:01,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284626383] [2024-10-13 12:56:01,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 12:56:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,990 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-13 12:56:01,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:01,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284626383] [2024-10-13 12:56:01,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284626383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:01,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:56:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143051422] [2024-10-13 12:56:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:01,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:56:01,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:01,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:56:01,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:56:01,992 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-13 12:56:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:02,089 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2024-10-13 12:56:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:56:02,089 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-13 12:56:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:02,090 INFO L225 Difference]: With dead ends: 204 [2024-10-13 12:56:02,090 INFO L226 Difference]: Without dead ends: 201 [2024-10-13 12:56:02,091 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-13 12:56:02,091 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-13 12:56:02,091 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-13 12:56:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-13 12:56:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2024-10-13 12:56:02,101 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-13 12:56:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-10-13 12:56:02,102 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 43 [2024-10-13 12:56:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:02,102 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-10-13 12:56:02,102 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-13 12:56:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-10-13 12:56:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 12:56:02,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:02,103 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-13 12:56:02,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:56:02,103 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:02,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash 574202137, now seen corresponding path program 1 times [2024-10-13 12:56:02,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:02,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032337165] [2024-10-13 12:56:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 12:56:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,198 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-13 12:56:02,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:02,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032337165] [2024-10-13 12:56:02,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032337165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:02,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:02,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:56:02,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024616739] [2024-10-13 12:56:02,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:02,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:56:02,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:02,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:56:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:56:02,201 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-13 12:56:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:02,301 INFO L93 Difference]: Finished difference Result 198 states and 240 transitions. [2024-10-13 12:56:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:56:02,302 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-13 12:56:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:02,303 INFO L225 Difference]: With dead ends: 198 [2024-10-13 12:56:02,303 INFO L226 Difference]: Without dead ends: 196 [2024-10-13 12:56:02,304 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-13 12:56:02,304 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 135 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 12:56:02,305 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-13 12:56:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-13 12:56:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 180. [2024-10-13 12:56:02,317 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-13 12:56:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 220 transitions. [2024-10-13 12:56:02,318 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 220 transitions. Word has length 43 [2024-10-13 12:56:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:02,319 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 220 transitions. [2024-10-13 12:56:02,320 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-13 12:56:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 220 transitions. [2024-10-13 12:56:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 12:56:02,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:02,321 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-13 12:56:02,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 12:56:02,321 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:02,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1653078402, now seen corresponding path program 1 times [2024-10-13 12:56:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:02,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564074688] [2024-10-13 12:56:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:02,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,425 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-13 12:56:02,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:02,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564074688] [2024-10-13 12:56:02,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564074688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:02,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:02,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:56:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628493716] [2024-10-13 12:56:02,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:02,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:56:02,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:02,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:56:02,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:56:02,426 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-13 12:56:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:02,492 INFO L93 Difference]: Finished difference Result 334 states and 410 transitions. [2024-10-13 12:56:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:56:02,492 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-13 12:56:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:02,494 INFO L225 Difference]: With dead ends: 334 [2024-10-13 12:56:02,494 INFO L226 Difference]: Without dead ends: 200 [2024-10-13 12:56:02,494 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-13 12:56:02,495 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-13 12:56:02,495 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-13 12:56:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-13 12:56:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2024-10-13 12:56:02,505 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-13 12:56:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 213 transitions. [2024-10-13 12:56:02,506 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 213 transitions. Word has length 44 [2024-10-13 12:56:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:02,506 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 213 transitions. [2024-10-13 12:56:02,506 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-13 12:56:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 213 transitions. [2024-10-13 12:56:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 12:56:02,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:02,507 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-13 12:56:02,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 12:56:02,508 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:02,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -651337579, now seen corresponding path program 1 times [2024-10-13 12:56:02,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:02,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475371933] [2024-10-13 12:56:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,638 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-13 12:56:02,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:02,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475371933] [2024-10-13 12:56:02,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475371933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:02,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:02,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:56:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067770774] [2024-10-13 12:56:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:02,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:56:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:02,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:56:02,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:56:02,640 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-13 12:56:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:02,755 INFO L93 Difference]: Finished difference Result 382 states and 462 transitions. [2024-10-13 12:56:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:56:02,756 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-13 12:56:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:02,757 INFO L225 Difference]: With dead ends: 382 [2024-10-13 12:56:02,757 INFO L226 Difference]: Without dead ends: 249 [2024-10-13 12:56:02,758 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-13 12:56:02,758 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 52 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 12:56:02,758 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-13 12:56:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-13 12:56:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 176. [2024-10-13 12:56:02,770 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-13 12:56:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2024-10-13 12:56:02,771 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 45 [2024-10-13 12:56:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:02,771 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2024-10-13 12:56:02,772 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-13 12:56:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2024-10-13 12:56:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 12:56:02,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:02,772 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-13 12:56:02,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 12:56:02,773 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:02,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:02,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1296258099, now seen corresponding path program 1 times [2024-10-13 12:56:02,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:02,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498800078] [2024-10-13 12:56:02,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:02,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,946 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-13 12:56:02,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:02,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498800078] [2024-10-13 12:56:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498800078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:56:02,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591556660] [2024-10-13 12:56:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:02,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:02,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:56:02,949 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-13 12:56:02,950 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-13 12:56:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:03,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:56:03,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:56:03,283 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-13 12:56:03,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:56:03,820 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-13 12:56:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591556660] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:56:03,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:56:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-10-13 12:56:03,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738409485] [2024-10-13 12:56:03,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:56:03,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 12:56:03,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 12:56:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-10-13 12:56:03,822 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-13 12:56:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:04,455 INFO L93 Difference]: Finished difference Result 484 states and 584 transitions. [2024-10-13 12:56:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 12:56:04,455 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-13 12:56:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:04,457 INFO L225 Difference]: With dead ends: 484 [2024-10-13 12:56:04,457 INFO L226 Difference]: Without dead ends: 336 [2024-10-13 12:56:04,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=373, Unknown=0, NotChecked=0, Total=600 [2024-10-13 12:56:04,458 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 123 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-13 12:56:04,458 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-13 12:56:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-13 12:56:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 176. [2024-10-13 12:56:04,477 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-13 12:56:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2024-10-13 12:56:04,478 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 50 [2024-10-13 12:56:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:04,478 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2024-10-13 12:56:04,479 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-13 12:56:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2024-10-13 12:56:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 12:56:04,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:04,479 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-13 12:56:04,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 12:56:04,680 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-13 12:56:04,680 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:04,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1454208409, now seen corresponding path program 1 times [2024-10-13 12:56:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:04,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763038124] [2024-10-13 12:56:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:04,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:04,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:04,869 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-13 12:56:04,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763038124] [2024-10-13 12:56:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763038124] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:56:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773813186] [2024-10-13 12:56:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:04,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:04,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:56:04,872 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-13 12:56:04,874 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-13 12:56:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:04,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:56:04,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:56:05,048 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-13 12:56:05,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:56:05,353 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-13 12:56:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773813186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:56:05,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:56:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-10-13 12:56:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008670936] [2024-10-13 12:56:05,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:56:05,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 12:56:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:05,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 12:56:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2024-10-13 12:56:05,355 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-13 12:56:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:05,827 INFO L93 Difference]: Finished difference Result 952 states and 1190 transitions. [2024-10-13 12:56:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 12:56:05,828 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-13 12:56:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:05,831 INFO L225 Difference]: With dead ends: 952 [2024-10-13 12:56:05,831 INFO L226 Difference]: Without dead ends: 830 [2024-10-13 12:56:05,832 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-13 12:56:05,833 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 421 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:05,833 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.4s Time] [2024-10-13 12:56:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-13 12:56:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 216. [2024-10-13 12:56:05,851 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-13 12:56:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 256 transitions. [2024-10-13 12:56:05,852 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 256 transitions. Word has length 61 [2024-10-13 12:56:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:05,853 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 256 transitions. [2024-10-13 12:56:05,853 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-13 12:56:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 256 transitions. [2024-10-13 12:56:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 12:56:05,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:05,854 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-13 12:56:05,870 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-13 12:56:06,054 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-13 12:56:06,055 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:06,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash -223107635, now seen corresponding path program 2 times [2024-10-13 12:56:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407586169] [2024-10-13 12:56:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:06,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:06,416 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-13 12:56:06,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:06,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407586169] [2024-10-13 12:56:06,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407586169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:56:06,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890700862] [2024-10-13 12:56:06,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:56:06,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:06,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:56:06,418 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-13 12:56:06,420 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-13 12:56:06,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:56:06,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:56:06,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 12:56:06,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:56:07,885 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-13 12:56:07,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:56:09,203 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-13 12:56:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890700862] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:56:09,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:56:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 41 [2024-10-13 12:56:09,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643611404] [2024-10-13 12:56:09,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:56:09,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-13 12:56:09,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:09,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-13 12:56:09,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 12:56:09,206 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-13 12:56:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:13,734 INFO L93 Difference]: Finished difference Result 674 states and 810 transitions. [2024-10-13 12:56:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-13 12:56:13,734 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-13 12:56:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:13,736 INFO L225 Difference]: With dead ends: 674 [2024-10-13 12:56:13,736 INFO L226 Difference]: Without dead ends: 524 [2024-10-13 12:56:13,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=951, Invalid=2019, Unknown=0, NotChecked=0, Total=2970 [2024-10-13 12:56:13,738 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 390 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:13,738 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.8s Time] [2024-10-13 12:56:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-13 12:56:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 216. [2024-10-13 12:56:13,757 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-13 12:56:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 248 transitions. [2024-10-13 12:56:13,758 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 248 transitions. Word has length 70 [2024-10-13 12:56:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:13,758 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 248 transitions. [2024-10-13 12:56:13,758 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-13 12:56:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 248 transitions. [2024-10-13 12:56:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 12:56:13,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:13,759 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-13 12:56:13,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 12:56:13,959 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-13 12:56:13,960 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:13,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2082472345, now seen corresponding path program 2 times [2024-10-13 12:56:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370801036] [2024-10-13 12:56:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:14,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:14,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:14,463 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-13 12:56:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:14,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370801036] [2024-10-13 12:56:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370801036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:56:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540582803] [2024-10-13 12:56:14,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:56:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:56:14,466 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-13 12:56:14,467 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-13 12:56:14,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:56:14,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:56:14,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 12:56:14,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:56:14,757 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-13 12:56:14,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:56:15,403 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-13 12:56:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540582803] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:56:15,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:56:15,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2024-10-13 12:56:15,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651966013] [2024-10-13 12:56:15,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:56:15,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 12:56:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:15,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 12:56:15,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 12:56:15,406 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-13 12:56:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:16,145 INFO L93 Difference]: Finished difference Result 1672 states and 2102 transitions. [2024-10-13 12:56:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-13 12:56:16,146 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-13 12:56:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:16,151 INFO L225 Difference]: With dead ends: 1672 [2024-10-13 12:56:16,151 INFO L226 Difference]: Without dead ends: 1550 [2024-10-13 12:56:16,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2024-10-13 12:56:16,152 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1389 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:16,153 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.5s Time] [2024-10-13 12:56:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2024-10-13 12:56:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 296. [2024-10-13 12:56:16,181 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-13 12:56:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 344 transitions. [2024-10-13 12:56:16,182 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 344 transitions. Word has length 101 [2024-10-13 12:56:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:16,182 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 344 transitions. [2024-10-13 12:56:16,183 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-13 12:56:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 344 transitions. [2024-10-13 12:56:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 12:56:16,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:16,184 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-13 12:56:16,201 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-13 12:56:16,384 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-13 12:56:16,385 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-13 12:56:16,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash -144795187, now seen corresponding path program 3 times [2024-10-13 12:56:16,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:16,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488397750] [2024-10-13 12:56:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:16,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:17,170 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-13 12:56:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488397750] [2024-10-13 12:56:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488397750] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:56:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464248832] [2024-10-13 12:56:17,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:56:17,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:17,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:56:17,173 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-13 12:56:17,174 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-13 12:56:17,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-10-13 12:56:17,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:56:17,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-13 12:56:17,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:56:21,069 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-13 12:56:21,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:56:34,429 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-13 12:56:34,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464248832] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:56:34,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:56:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 33] total 80 [2024-10-13 12:56:34,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404704292] [2024-10-13 12:56:34,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:56:34,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-10-13 12:56:34,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:34,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-10-13 12:56:34,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1662, Invalid=4657, Unknown=1, NotChecked=0, Total=6320 [2024-10-13 12:56:34,433 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)