./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:42:42,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:42:42,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 16:42:42,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:42:42,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:42:42,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:42:42,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:42:42,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:42:42,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:42:42,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:42:42,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:42:42,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:42:42,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:42:42,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:42:42,679 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:42:42,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:42:42,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:42:42,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:42:42,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:42:42,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:42:42,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:42:42,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:42:42,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:42:42,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:42:42,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:42:42,683 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:42:42,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:42:42,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:42:42,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:42:42,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:42:42,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:42:42,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:42:42,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:42:42,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:42:42,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:42:42,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:42:42,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:42:42,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:42:42,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:42:42,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:42:42,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:42:42,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:42:42,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:42:42,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:42:42,695 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 -> 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff [2024-11-12 16:42:42,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:42:42,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:42:42,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:42:42,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:42:42,989 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:42:42,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2024-11-12 16:42:44,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:42:44,592 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:42:44,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2024-11-12 16:42:44,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e546759c/5d95639d14e842a79400cef7239008cb/FLAG53aa088b0 [2024-11-12 16:42:44,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e546759c/5d95639d14e842a79400cef7239008cb [2024-11-12 16:42:44,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:42:44,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:42:44,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:42:44,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:42:44,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:42:44,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:42:44" (1/1) ... [2024-11-12 16:42:44,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a39c8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:44, skipping insertion in model container [2024-11-12 16:42:44,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:42:44" (1/1) ... [2024-11-12 16:42:45,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:42:45,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:42:45,262 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:42:45,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:42:45,313 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:42:45,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45 WrapperNode [2024-11-12 16:42:45,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:42:45,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:42:45,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:42:45,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:42:45,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,368 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-11-12 16:42:45,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:42:45,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:42:45,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:42:45,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:42:45,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 16:42:45,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:42:45,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:42:45,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:42:45,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:42:45,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (1/1) ... [2024-11-12 16:42:45,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:42:45,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:45,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:42:45,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:42:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:42:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:42:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-12 16:42:45,537 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-12 16:42:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:42:45,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:42:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 16:42:45,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 16:42:45,599 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:42:45,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:42:46,083 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-12 16:42:46,083 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:42:46,104 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:42:46,106 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 16:42:46,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:46 BoogieIcfgContainer [2024-11-12 16:42:46,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:42:46,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:42:46,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:42:46,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:42:46,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:42:44" (1/3) ... [2024-11-12 16:42:46,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62940da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:42:46, skipping insertion in model container [2024-11-12 16:42:46,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:45" (2/3) ... [2024-11-12 16:42:46,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62940da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:42:46, skipping insertion in model container [2024-11-12 16:42:46,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:46" (3/3) ... [2024-11-12 16:42:46,117 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2024-11-12 16:42:46,135 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:42:46,136 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-12 16:42:46,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:42:46,218 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;@1b09906e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:42:46,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-12 16:42:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 116 states have internal predecessors, (150), 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-11-12 16:42:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 16:42:46,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:46,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:46,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:46,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:46,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1302203311, now seen corresponding path program 1 times [2024-11-12 16:42:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906201145] [2024-11-12 16:42:46,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:46,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906201145] [2024-11-12 16:42:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906201145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:46,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:46,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:42:46,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79221016] [2024-11-12 16:42:46,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:46,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:46,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:46,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:42:46,535 INFO L87 Difference]: Start difference. First operand has 123 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 116 states have internal predecessors, (150), 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.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:46,715 INFO L93 Difference]: Finished difference Result 297 states and 411 transitions. [2024-11-12 16:42:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:46,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 16:42:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:46,728 INFO L225 Difference]: With dead ends: 297 [2024-11-12 16:42:46,728 INFO L226 Difference]: Without dead ends: 157 [2024-11-12 16:42:46,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:46,736 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 90 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:46,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 393 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-12 16:42:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2024-11-12 16:42:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.495798319327731) internal successors, (178), 138 states have internal predecessors, (178), 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-11-12 16:42:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2024-11-12 16:42:46,778 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 9 [2024-11-12 16:42:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:46,779 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 186 transitions. [2024-11-12 16:42:46,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 186 transitions. [2024-11-12 16:42:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 16:42:46,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:46,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:46,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:42:46,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:46,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2018629041, now seen corresponding path program 1 times [2024-11-12 16:42:46,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699525674] [2024-11-12 16:42:46,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:46,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699525674] [2024-11-12 16:42:46,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699525674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:46,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:46,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:42:46,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302230769] [2024-11-12 16:42:46,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:46,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:42:46,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:46,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:42:46,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:46,846 INFO L87 Difference]: Start difference. First operand 145 states and 186 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:46,910 INFO L93 Difference]: Finished difference Result 301 states and 393 transitions. [2024-11-12 16:42:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:42:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 16:42:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:46,916 INFO L225 Difference]: With dead ends: 301 [2024-11-12 16:42:46,917 INFO L226 Difference]: Without dead ends: 159 [2024-11-12 16:42:46,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:46,919 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:46,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 213 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-12 16:42:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2024-11-12 16:42:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 142 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-11-12 16:42:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 190 transitions. [2024-11-12 16:42:46,951 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 190 transitions. Word has length 14 [2024-11-12 16:42:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:46,951 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 190 transitions. [2024-11-12 16:42:46,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 190 transitions. [2024-11-12 16:42:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 16:42:46,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:46,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:46,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:42:46,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:46,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:46,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2018517695, now seen corresponding path program 1 times [2024-11-12 16:42:46,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:46,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89185841] [2024-11-12 16:42:46,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:46,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:42:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:47,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89185841] [2024-11-12 16:42:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89185841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:47,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:47,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:42:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304934144] [2024-11-12 16:42:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:47,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:42:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:47,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:42:47,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:47,026 INFO L87 Difference]: Start difference. First operand 149 states and 190 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:47,075 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2024-11-12 16:42:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:42:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 16:42:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:47,080 INFO L225 Difference]: With dead ends: 149 [2024-11-12 16:42:47,080 INFO L226 Difference]: Without dead ends: 148 [2024-11-12 16:42:47,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:47,082 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:47,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 204 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-12 16:42:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-12 16:42:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 141 states have internal predecessors, (180), 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-11-12 16:42:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 188 transitions. [2024-11-12 16:42:47,096 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 188 transitions. Word has length 14 [2024-11-12 16:42:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:47,096 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 188 transitions. [2024-11-12 16:42:47,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2024-11-12 16:42:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 16:42:47,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:47,098 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:47,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:42:47,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 829234525, now seen corresponding path program 1 times [2024-11-12 16:42:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986769268] [2024-11-12 16:42:47,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:47,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:47,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986769268] [2024-11-12 16:42:47,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986769268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:47,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049844350] [2024-11-12 16:42:47,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:47,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:47,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:47,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:47,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 16:42:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:47,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:42:47,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:47,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:42:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049844350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:47,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:42:47,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-12 16:42:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682656391] [2024-11-12 16:42:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:47,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:47,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:47,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:42:47,332 INFO L87 Difference]: Start difference. First operand 148 states and 188 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:47,408 INFO L93 Difference]: Finished difference Result 174 states and 228 transitions. [2024-11-12 16:42:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:47,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 16:42:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:47,410 INFO L225 Difference]: With dead ends: 174 [2024-11-12 16:42:47,410 INFO L226 Difference]: Without dead ends: 172 [2024-11-12 16:42:47,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:42:47,415 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:47,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 208 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-12 16:42:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2024-11-12 16:42:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 148 states have internal predecessors, (187), 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-11-12 16:42:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 195 transitions. [2024-11-12 16:42:47,433 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 195 transitions. Word has length 15 [2024-11-12 16:42:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:47,434 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 195 transitions. [2024-11-12 16:42:47,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 195 transitions. [2024-11-12 16:42:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 16:42:47,437 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:47,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:47,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 16:42:47,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:47,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:47,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1850460838, now seen corresponding path program 1 times [2024-11-12 16:42:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:47,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640880214] [2024-11-12 16:42:47,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:47,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640880214] [2024-11-12 16:42:47,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640880214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:47,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257847987] [2024-11-12 16:42:47,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:47,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:47,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:47,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:47,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 16:42:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:47,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:42:47,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:47,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:42:47,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257847987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:47,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:42:47,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-12 16:42:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506576327] [2024-11-12 16:42:47,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:47,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:42:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:47,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:42:47,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:42:47,848 INFO L87 Difference]: Start difference. First operand 155 states and 195 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:47,895 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2024-11-12 16:42:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:42:47,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 16:42:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:47,896 INFO L225 Difference]: With dead ends: 161 [2024-11-12 16:42:47,897 INFO L226 Difference]: Without dead ends: 160 [2024-11-12 16:42:47,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:42:47,899 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:47,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 195 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-12 16:42:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-11-12 16:42:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 150 states have internal predecessors, (189), 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-11-12 16:42:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2024-11-12 16:42:47,916 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 15 [2024-11-12 16:42:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:47,917 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2024-11-12 16:42:47,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2024-11-12 16:42:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 16:42:47,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:47,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:47,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 16:42:48,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:48,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:48,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash -63533408, now seen corresponding path program 1 times [2024-11-12 16:42:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:48,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509088864] [2024-11-12 16:42:48,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 16:42:48,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:48,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509088864] [2024-11-12 16:42:48,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509088864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:48,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:48,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:42:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585420704] [2024-11-12 16:42:48,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:48,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:42:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:42:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:48,149 INFO L87 Difference]: Start difference. First operand 157 states and 197 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-11-12 16:42:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:48,188 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2024-11-12 16:42:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:42:48,189 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 16 [2024-11-12 16:42:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:48,190 INFO L225 Difference]: With dead ends: 157 [2024-11-12 16:42:48,190 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 16:42:48,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:48,191 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:48,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 16:42:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2024-11-12 16:42:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 147 states have internal predecessors, (185), 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-11-12 16:42:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 193 transitions. [2024-11-12 16:42:48,198 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 193 transitions. Word has length 16 [2024-11-12 16:42:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:48,198 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 193 transitions. [2024-11-12 16:42:48,198 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-11-12 16:42:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 193 transitions. [2024-11-12 16:42:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 16:42:48,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:48,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:48,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:42:48,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:48,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash -801496273, now seen corresponding path program 1 times [2024-11-12 16:42:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418474168] [2024-11-12 16:42:48,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:48,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418474168] [2024-11-12 16:42:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418474168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:48,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:48,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:42:48,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364381831] [2024-11-12 16:42:48,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:48,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:42:48,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:48,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:42:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:48,223 INFO L87 Difference]: Start difference. First operand 154 states and 193 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:48,257 INFO L93 Difference]: Finished difference Result 315 states and 400 transitions. [2024-11-12 16:42:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:42:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 16:42:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:48,258 INFO L225 Difference]: With dead ends: 315 [2024-11-12 16:42:48,258 INFO L226 Difference]: Without dead ends: 164 [2024-11-12 16:42:48,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:48,260 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:48,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 211 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-12 16:42:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2024-11-12 16:42:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 149 states have internal predecessors, (185), 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-11-12 16:42:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2024-11-12 16:42:48,266 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2024-11-12 16:42:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:48,266 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2024-11-12 16:42:48,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2024-11-12 16:42:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 16:42:48,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:48,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:48,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:42:48,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1421009672, now seen corresponding path program 1 times [2024-11-12 16:42:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589798701] [2024-11-12 16:42:48,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:48,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:48,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589798701] [2024-11-12 16:42:48,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589798701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:48,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:48,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:48,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938047826] [2024-11-12 16:42:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:48,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:48,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:48,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:48,320 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:48,440 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2024-11-12 16:42:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 16:42:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:48,441 INFO L225 Difference]: With dead ends: 176 [2024-11-12 16:42:48,442 INFO L226 Difference]: Without dead ends: 174 [2024-11-12 16:42:48,443 INFO L434 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-11-12 16:42:48,444 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:48,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 378 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-12 16:42:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2024-11-12 16:42:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.39568345323741) internal successors, (194), 156 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-11-12 16:42:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 202 transitions. [2024-11-12 16:42:48,457 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 202 transitions. Word has length 16 [2024-11-12 16:42:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:48,460 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 202 transitions. [2024-11-12 16:42:48,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 202 transitions. [2024-11-12 16:42:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 16:42:48,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:48,461 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:48,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:42:48,461 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:48,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1967372727, now seen corresponding path program 1 times [2024-11-12 16:42:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:48,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471662498] [2024-11-12 16:42:48,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:48,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:48,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471662498] [2024-11-12 16:42:48,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471662498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:48,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58766035] [2024-11-12 16:42:48,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:48,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:48,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:48,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:48,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 16:42:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:48,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:42:48,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:48,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:42:48,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58766035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:48,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:42:48,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-12 16:42:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111186606] [2024-11-12 16:42:48,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:48,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:48,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:48,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:48,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:42:48,649 INFO L87 Difference]: Start difference. First operand 163 states and 202 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:48,719 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2024-11-12 16:42:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:48,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-12 16:42:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:48,721 INFO L225 Difference]: With dead ends: 171 [2024-11-12 16:42:48,721 INFO L226 Difference]: Without dead ends: 170 [2024-11-12 16:42:48,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:42:48,722 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 9 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:48,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 300 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-12 16:42:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2024-11-12 16:42:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 143 states have (on average 1.3776223776223777) internal successors, (197), 160 states have internal predecessors, (197), 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-11-12 16:42:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2024-11-12 16:42:48,729 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 17 [2024-11-12 16:42:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:48,731 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2024-11-12 16:42:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2024-11-12 16:42:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 16:42:48,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:48,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:48,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 16:42:48,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:48,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:48,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1720101466, now seen corresponding path program 1 times [2024-11-12 16:42:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347248517] [2024-11-12 16:42:48,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:49,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:49,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347248517] [2024-11-12 16:42:49,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347248517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:49,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:49,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:49,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155356268] [2024-11-12 16:42:49,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:49,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:49,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:49,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:49,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:42:49,030 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:49,082 INFO L93 Difference]: Finished difference Result 336 states and 412 transitions. [2024-11-12 16:42:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:49,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-12 16:42:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:49,084 INFO L225 Difference]: With dead ends: 336 [2024-11-12 16:42:49,084 INFO L226 Difference]: Without dead ends: 172 [2024-11-12 16:42:49,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:49,086 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:49,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 317 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-12 16:42:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-12 16:42:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 147 states have (on average 1.3673469387755102) internal successors, (201), 164 states have internal predecessors, (201), 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-11-12 16:42:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2024-11-12 16:42:49,100 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 17 [2024-11-12 16:42:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:49,100 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2024-11-12 16:42:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2024-11-12 16:42:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 16:42:49,103 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:49,103 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:49,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:42:49,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:49,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash -448658972, now seen corresponding path program 1 times [2024-11-12 16:42:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097781503] [2024-11-12 16:42:49,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:42:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097781503] [2024-11-12 16:42:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097781503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306433732] [2024-11-12 16:42:49,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:49,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:49,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:49,194 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:42:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:49,301 INFO L93 Difference]: Finished difference Result 235 states and 286 transitions. [2024-11-12 16:42:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:49,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-12 16:42:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:49,306 INFO L225 Difference]: With dead ends: 235 [2024-11-12 16:42:49,307 INFO L226 Difference]: Without dead ends: 231 [2024-11-12 16:42:49,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:42:49,308 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 139 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:49,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 302 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-12 16:42:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2024-11-12 16:42:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 210 states have internal predecessors, (261), 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-11-12 16:42:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2024-11-12 16:42:49,333 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 24 [2024-11-12 16:42:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:49,333 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2024-11-12 16:42:49,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:42:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2024-11-12 16:42:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 16:42:49,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:49,335 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:49,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 16:42:49,335 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:49,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash -477286328, now seen corresponding path program 1 times [2024-11-12 16:42:49,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:49,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176877634] [2024-11-12 16:42:49,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:42:49,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:49,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176877634] [2024-11-12 16:42:49,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176877634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:49,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:49,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:49,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769635003] [2024-11-12 16:42:49,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:49,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:49,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:49,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:49,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:49,421 INFO L87 Difference]: Start difference. First operand 219 states and 269 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:42:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:49,529 INFO L93 Difference]: Finished difference Result 233 states and 281 transitions. [2024-11-12 16:42:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:49,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-12 16:42:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:49,532 INFO L225 Difference]: With dead ends: 233 [2024-11-12 16:42:49,533 INFO L226 Difference]: Without dead ends: 231 [2024-11-12 16:42:49,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:42:49,534 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:49,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 305 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-12 16:42:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 210. [2024-11-12 16:42:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 185 states have (on average 1.3405405405405406) internal successors, (248), 201 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-11-12 16:42:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 256 transitions. [2024-11-12 16:42:49,549 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 256 transitions. Word has length 24 [2024-11-12 16:42:49,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:49,549 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 256 transitions. [2024-11-12 16:42:49,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:42:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 256 transitions. [2024-11-12 16:42:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 16:42:49,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:49,550 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 16:42:49,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:49,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -555382723, now seen corresponding path program 1 times [2024-11-12 16:42:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:49,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541330556] [2024-11-12 16:42:49,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541330556] [2024-11-12 16:42:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541330556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:49,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:49,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635057754] [2024-11-12 16:42:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:49,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:49,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:42:49,626 INFO L87 Difference]: Start difference. First operand 210 states and 256 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:49,689 INFO L93 Difference]: Finished difference Result 368 states and 448 transitions. [2024-11-12 16:42:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:49,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2024-11-12 16:42:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:49,691 INFO L225 Difference]: With dead ends: 368 [2024-11-12 16:42:49,691 INFO L226 Difference]: Without dead ends: 187 [2024-11-12 16:42:49,692 INFO L434 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-11-12 16:42:49,692 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 37 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:49,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 317 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-12 16:42:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-11-12 16:42:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 175 states have internal predecessors, (215), 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-11-12 16:42:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2024-11-12 16:42:49,704 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 24 [2024-11-12 16:42:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:49,704 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2024-11-12 16:42:49,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2024-11-12 16:42:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 16:42:49,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:49,705 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:49,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 16:42:49,707 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:49,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash 63091986, now seen corresponding path program 1 times [2024-11-12 16:42:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:49,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102689570] [2024-11-12 16:42:49,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:49,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:49,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102689570] [2024-11-12 16:42:49,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102689570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:49,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:49,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:49,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993255972] [2024-11-12 16:42:49,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:49,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:49,772 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:49,857 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2024-11-12 16:42:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:42:49,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 24 [2024-11-12 16:42:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:49,859 INFO L225 Difference]: With dead ends: 355 [2024-11-12 16:42:49,859 INFO L226 Difference]: Without dead ends: 204 [2024-11-12 16:42:49,860 INFO L434 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-11-12 16:42:49,860 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 71 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:49,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 383 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-12 16:42:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2024-11-12 16:42:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 187 states have internal predecessors, (229), 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-11-12 16:42:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2024-11-12 16:42:49,869 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 24 [2024-11-12 16:42:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:49,870 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2024-11-12 16:42:49,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2024-11-12 16:42:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 16:42:49,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:49,871 INFO L218 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, 1, 1] [2024-11-12 16:42:49,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 16:42:49,872 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:49,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash 324492628, now seen corresponding path program 1 times [2024-11-12 16:42:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463425440] [2024-11-12 16:42:49,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 16:42:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463425440] [2024-11-12 16:42:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463425440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:42:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418004630] [2024-11-12 16:42:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:49,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:49,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:49,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:49,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:42:49,919 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:49,974 INFO L93 Difference]: Finished difference Result 201 states and 244 transitions. [2024-11-12 16:42:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:49,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 29 [2024-11-12 16:42:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:49,975 INFO L225 Difference]: With dead ends: 201 [2024-11-12 16:42:49,975 INFO L226 Difference]: Without dead ends: 200 [2024-11-12 16:42:49,976 INFO L434 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-11-12 16:42:49,976 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 8 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:49,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 279 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-12 16:42:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 186. [2024-11-12 16:42:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3478260869565217) internal successors, (217), 177 states have internal predecessors, (217), 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-11-12 16:42:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2024-11-12 16:42:49,988 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 29 [2024-11-12 16:42:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:49,988 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2024-11-12 16:42:49,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2024-11-12 16:42:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 16:42:49,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:49,989 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 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, 1] [2024-11-12 16:42:49,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 16:42:49,989 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:49,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1973004361, now seen corresponding path program 1 times [2024-11-12 16:42:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:49,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145499347] [2024-11-12 16:42:49,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:50,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:50,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:50,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 16:42:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 16:42:50,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145499347] [2024-11-12 16:42:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145499347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758040774] [2024-11-12 16:42:50,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:50,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:50,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:50,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:50,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 16:42:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:50,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:42:50,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 16:42:50,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:42:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 16:42:50,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758040774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:42:50,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:42:50,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-12 16:42:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729656870] [2024-11-12 16:42:50,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:42:50,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:42:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:42:50,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-12 16:42:50,458 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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-11-12 16:42:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:50,752 INFO L93 Difference]: Finished difference Result 652 states and 826 transitions. [2024-11-12 16:42:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 16:42:50,752 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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 44 [2024-11-12 16:42:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:50,755 INFO L225 Difference]: With dead ends: 652 [2024-11-12 16:42:50,755 INFO L226 Difference]: Without dead ends: 501 [2024-11-12 16:42:50,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 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-11-12 16:42:50,756 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 220 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:50,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 503 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 16:42:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-12 16:42:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 206. [2024-11-12 16:42:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 197 states have internal predecessors, (241), 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-11-12 16:42:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 249 transitions. [2024-11-12 16:42:50,770 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 249 transitions. Word has length 44 [2024-11-12 16:42:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:50,771 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 249 transitions. [2024-11-12 16:42:50,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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-11-12 16:42:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 249 transitions. [2024-11-12 16:42:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 16:42:50,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:50,772 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:50,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 16:42:50,972 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-11-12 16:42:50,972 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:50,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1869642328, now seen corresponding path program 1 times [2024-11-12 16:42:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:50,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235111645] [2024-11-12 16:42:50,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 16:42:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 16:42:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235111645] [2024-11-12 16:42:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235111645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:51,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:51,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937574683] [2024-11-12 16:42:51,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:51,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:51,046 INFO L87 Difference]: Start difference. First operand 206 states and 249 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-11-12 16:42:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:51,145 INFO L93 Difference]: Finished difference Result 210 states and 252 transitions. [2024-11-12 16:42:51,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:51,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 47 [2024-11-12 16:42:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:51,147 INFO L225 Difference]: With dead ends: 210 [2024-11-12 16:42:51,147 INFO L226 Difference]: Without dead ends: 207 [2024-11-12 16:42:51,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:42:51,148 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 130 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:51,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 324 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-12 16:42:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2024-11-12 16:42:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 174 states have (on average 1.3160919540229885) internal successors, (229), 187 states have internal predecessors, (229), 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-11-12 16:42:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2024-11-12 16:42:51,161 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 47 [2024-11-12 16:42:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:51,161 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2024-11-12 16:42:51,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-11-12 16:42:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2024-11-12 16:42:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 16:42:51,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:51,162 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:51,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 16:42:51,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:51,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:51,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1898269684, now seen corresponding path program 1 times [2024-11-12 16:42:51,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:51,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166872541] [2024-11-12 16:42:51,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 16:42:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 16:42:51,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166872541] [2024-11-12 16:42:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166872541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:51,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852682425] [2024-11-12 16:42:51,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:51,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:51,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:51,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:51,229 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-11-12 16:42:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:51,321 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2024-11-12 16:42:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:51,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 47 [2024-11-12 16:42:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:51,323 INFO L225 Difference]: With dead ends: 204 [2024-11-12 16:42:51,323 INFO L226 Difference]: Without dead ends: 202 [2024-11-12 16:42:51,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:42:51,323 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 138 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:51,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 319 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-12 16:42:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2024-11-12 16:42:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 176 states have internal predecessors, (217), 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-11-12 16:42:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 225 transitions. [2024-11-12 16:42:51,335 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 225 transitions. Word has length 47 [2024-11-12 16:42:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:51,335 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 225 transitions. [2024-11-12 16:42:51,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-11-12 16:42:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 225 transitions. [2024-11-12 16:42:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 16:42:51,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:51,336 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:51,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 16:42:51,336 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:51,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:51,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1454050813, now seen corresponding path program 1 times [2024-11-12 16:42:51,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:51,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033356508] [2024-11-12 16:42:51,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 16:42:51,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:51,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033356508] [2024-11-12 16:42:51,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033356508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:51,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:51,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:51,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075446052] [2024-11-12 16:42:51,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:51,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:51,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:51,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:51,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:42:51,446 INFO L87 Difference]: Start difference. First operand 185 states and 225 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-12 16:42:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:51,507 INFO L93 Difference]: Finished difference Result 347 states and 423 transitions. [2024-11-12 16:42:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:42:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 47 [2024-11-12 16:42:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:51,509 INFO L225 Difference]: With dead ends: 347 [2024-11-12 16:42:51,509 INFO L226 Difference]: Without dead ends: 210 [2024-11-12 16:42:51,510 INFO L434 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-11-12 16:42:51,510 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 11 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:51,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 302 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-12 16:42:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 181. [2024-11-12 16:42:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.3043478260869565) internal successors, (210), 172 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-11-12 16:42:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2024-11-12 16:42:51,524 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 47 [2024-11-12 16:42:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:51,524 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2024-11-12 16:42:51,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-12 16:42:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2024-11-12 16:42:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 16:42:51,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:51,525 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2024-11-12 16:42:51,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 16:42:51,526 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:51,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:51,526 INFO L85 PathProgramCache]: Analyzing trace with hash -338960106, now seen corresponding path program 1 times [2024-11-12 16:42:51,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:51,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636014844] [2024-11-12 16:42:51,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636014844] [2024-11-12 16:42:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636014844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:51,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:51,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:42:51,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606613566] [2024-11-12 16:42:51,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:51,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:51,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:51,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:51,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:51,669 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-11-12 16:42:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:51,773 INFO L93 Difference]: Finished difference Result 398 states and 478 transitions. [2024-11-12 16:42:51,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:51,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 48 [2024-11-12 16:42:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:51,775 INFO L225 Difference]: With dead ends: 398 [2024-11-12 16:42:51,775 INFO L226 Difference]: Without dead ends: 262 [2024-11-12 16:42:51,776 INFO L434 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-11-12 16:42:51,776 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:51,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-12 16:42:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 181. [2024-11-12 16:42:51,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 172 states have internal predecessors, (209), 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-11-12 16:42:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2024-11-12 16:42:51,792 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 48 [2024-11-12 16:42:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:51,793 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2024-11-12 16:42:51,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-11-12 16:42:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2024-11-12 16:42:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 16:42:51,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:51,794 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 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, 1] [2024-11-12 16:42:51,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 16:42:51,795 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:51,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1180459864, now seen corresponding path program 1 times [2024-11-12 16:42:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:51,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091696801] [2024-11-12 16:42:51,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:51,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:52,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:52,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091696801] [2024-11-12 16:42:52,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091696801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:52,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933431081] [2024-11-12 16:42:52,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:52,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:52,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:52,009 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:52,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 16:42:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:52,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:42:52,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:52,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:42:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933431081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:42:52,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:42:52,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-11-12 16:42:52,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594141320] [2024-11-12 16:42:52,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:42:52,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 16:42:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:52,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 16:42:52,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-11-12 16:42:52,699 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 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-11-12 16:42:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:53,927 INFO L93 Difference]: Finished difference Result 512 states and 612 transitions. [2024-11-12 16:42:53,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 16:42:53,928 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 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 53 [2024-11-12 16:42:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:53,930 INFO L225 Difference]: With dead ends: 512 [2024-11-12 16:42:53,930 INFO L226 Difference]: Without dead ends: 360 [2024-11-12 16:42:53,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 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-11-12 16:42:53,931 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 119 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:53,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 794 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 16:42:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-12 16:42:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 181. [2024-11-12 16:42:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.2732919254658386) internal successors, (205), 172 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-11-12 16:42:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2024-11-12 16:42:53,952 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 53 [2024-11-12 16:42:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:53,953 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2024-11-12 16:42:53,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 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-11-12 16:42:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2024-11-12 16:42:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 16:42:53,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:53,954 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 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-11-12 16:42:53,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 16:42:54,154 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-11-12 16:42:54,155 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:54,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash 302294674, now seen corresponding path program 1 times [2024-11-12 16:42:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:54,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855810453] [2024-11-12 16:42:54,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:54,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855810453] [2024-11-12 16:42:54,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855810453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623555076] [2024-11-12 16:42:54,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:54,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:54,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:54,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 16:42:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:54,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 16:42:54,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:54,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:42:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:54,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623555076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:42:54,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:42:54,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-11-12 16:42:54,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423842435] [2024-11-12 16:42:54,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:42:54,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 16:42:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:54,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 16:42:54,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2024-11-12 16:42:54,941 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 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-11-12 16:42:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:55,461 INFO L93 Difference]: Finished difference Result 969 states and 1207 transitions. [2024-11-12 16:42:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 16:42:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 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 64 [2024-11-12 16:42:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:55,465 INFO L225 Difference]: With dead ends: 969 [2024-11-12 16:42:55,465 INFO L226 Difference]: Without dead ends: 843 [2024-11-12 16:42:55,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2024-11-12 16:42:55,468 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 471 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:55,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 698 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 16:42:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-12 16:42:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 221. [2024-11-12 16:42:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 201 states have (on average 1.2587064676616915) internal successors, (253), 212 states have internal predecessors, (253), 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-11-12 16:42:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2024-11-12 16:42:55,526 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 64 [2024-11-12 16:42:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:55,527 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2024-11-12 16:42:55,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 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-11-12 16:42:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2024-11-12 16:42:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 16:42:55,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:55,528 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 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-11-12 16:42:55,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 16:42:55,732 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-11-12 16:42:55,733 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:42:55,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash 85610712, now seen corresponding path program 2 times [2024-11-12 16:42:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103999724] [2024-11-12 16:42:55,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:55,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103999724] [2024-11-12 16:42:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103999724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984266397] [2024-11-12 16:42:56,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:42:56,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:56,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:56,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 16:42:56,279 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:42:56,279 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:42:56,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 16:42:56,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:57,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:42:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:42:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984266397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:42:59,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:42:59,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 41 [2024-11-12 16:42:59,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021559269] [2024-11-12 16:42:59,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:42:59,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-12 16:42:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-12 16:42:59,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2024-11-12 16:42:59,410 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 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-11-12 16:43:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:43:04,454 INFO L93 Difference]: Finished difference Result 720 states and 856 transitions. [2024-11-12 16:43:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-12 16:43:04,455 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 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 73 [2024-11-12 16:43:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:43:04,458 INFO L225 Difference]: With dead ends: 720 [2024-11-12 16:43:04,458 INFO L226 Difference]: Without dead ends: 566 [2024-11-12 16:43:04,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=951, Invalid=2019, Unknown=0, NotChecked=0, Total=2970 [2024-11-12 16:43:04,460 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 375 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:43:04,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1718 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-12 16:43:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-12 16:43:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 221. [2024-11-12 16:43:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 201 states have (on average 1.2189054726368158) internal successors, (245), 212 states have internal predecessors, (245), 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-11-12 16:43:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2024-11-12 16:43:04,484 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 73 [2024-11-12 16:43:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:43:04,484 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2024-11-12 16:43:04,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 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-11-12 16:43:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2024-11-12 16:43:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 16:43:04,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:43:04,487 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 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-11-12 16:43:04,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 16:43:04,692 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-11-12 16:43:04,693 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:43:04,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:43:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1727507346, now seen corresponding path program 2 times [2024-11-12 16:43:04,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:43:04,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743125145] [2024-11-12 16:43:04,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:43:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:43:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:04,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:43:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:43:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:43:05,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:43:05,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743125145] [2024-11-12 16:43:05,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743125145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:43:05,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485003532] [2024-11-12 16:43:05,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:43:05,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:43:05,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:43:05,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:43:05,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 16:43:05,305 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:43:05,305 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:43:05,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 16:43:05,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:43:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:43:05,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:43:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:43:06,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485003532] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:43:06,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:43:06,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2024-11-12 16:43:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252079258] [2024-11-12 16:43:06,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:43:06,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 16:43:06,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:43:06,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 16:43:06,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 16:43:06,378 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 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-11-12 16:43:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:43:07,276 INFO L93 Difference]: Finished difference Result 1689 states and 2119 transitions. [2024-11-12 16:43:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-12 16:43:07,276 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 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 104 [2024-11-12 16:43:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:43:07,281 INFO L225 Difference]: With dead ends: 1689 [2024-11-12 16:43:07,282 INFO L226 Difference]: Without dead ends: 1563 [2024-11-12 16:43:07,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 180 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-11-12 16:43:07,284 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1168 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 16:43:07,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 779 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 16:43:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2024-11-12 16:43:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 301. [2024-11-12 16:43:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 281 states have (on average 1.2135231316725978) internal successors, (341), 292 states have internal predecessors, (341), 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-11-12 16:43:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 349 transitions. [2024-11-12 16:43:07,316 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 349 transitions. Word has length 104 [2024-11-12 16:43:07,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:43:07,316 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 349 transitions. [2024-11-12 16:43:07,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 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-11-12 16:43:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 349 transitions. [2024-11-12 16:43:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 16:43:07,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:43:07,318 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 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-11-12 16:43:07,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 16:43:07,522 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-11-12 16:43:07,523 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-12 16:43:07,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:43:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash 12381144, now seen corresponding path program 3 times [2024-11-12 16:43:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:43:07,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477108874] [2024-11-12 16:43:07,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:43:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:43:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:07,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:43:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:07,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:43:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:43:08,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:43:08,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477108874] [2024-11-12 16:43:08,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477108874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:43:08,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843647055] [2024-11-12 16:43:08,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:43:08,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:43:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:43:08,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:43:08,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 16:43:08,928 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-12 16:43:08,929 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:43:08,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-12 16:43:08,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:43:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:43:12,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:43:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:43:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843647055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:43:20,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:43:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 33] total 80 [2024-11-12 16:43:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046910470] [2024-11-12 16:43:20,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:43:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-12 16:43:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:43:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-12 16:43:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=4657, Unknown=0, NotChecked=0, Total=6320 [2024-11-12 16:43:20,999 INFO L87 Difference]: Start difference. First operand 301 states and 349 transitions. Second operand has 80 states, 80 states have (on average 3.3625) internal successors, (269), 80 states have internal predecessors, (269), 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)