./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2a.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:34:03,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:34:03,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:34:03,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:34:03,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:34:03,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:34:03,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:34:03,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:34:03,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:34:03,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:34:03,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:34:03,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:34:03,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:34:03,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:34:03,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:34:03,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:34:03,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:34:03,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:34:03,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:34:03,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:34:03,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:34:03,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:34:03,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:34:03,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:34:03,784 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:34:03,785 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:34:03,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:34:03,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:34:03,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:34:03,785 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:34:03,786 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:34:03,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:34:03,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:34:03,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:34:03,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:34:03,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:34:03,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:34:03,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:34:03,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:34:03,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:34:03,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:34:03,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:34:03,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:34:03,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:34:03,792 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2024-11-10 18:34:04,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:34:04,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:34:04,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:34:04,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:34:04,052 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:34:04,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-10 18:34:05,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:34:05,708 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:34:05,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-10 18:34:05,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d75b4cbc/40e5a54d59ab4d90b807ca5c0eb3e7b7/FLAG1810a2c5a [2024-11-10 18:34:05,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d75b4cbc/40e5a54d59ab4d90b807ca5c0eb3e7b7 [2024-11-10 18:34:05,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:34:05,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:34:05,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:34:05,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:34:05,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:34:05,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:05" (1/1) ... [2024-11-10 18:34:05,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f31a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:05, skipping insertion in model container [2024-11-10 18:34:05,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:05" (1/1) ... [2024-11-10 18:34:05,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:34:05,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:34:06,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:34:06,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:34:06,087 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:34:06,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06 WrapperNode [2024-11-10 18:34:06,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:34:06,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:34:06,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:34:06,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:34:06,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,136 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-11-10 18:34:06,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:34:06,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:34:06,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:34:06,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:34:06,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,187 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-10 18:34:06,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:34:06,207 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:34:06,210 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:34:06,210 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:34:06,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (1/1) ... [2024-11-10 18:34:06,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:34:06,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:06,252 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-10 18:34:06,255 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-10 18:34:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:34:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:34:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-10 18:34:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-10 18:34:06,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:34:06,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:34:06,309 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-10 18:34:06,309 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-10 18:34:06,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 18:34:06,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 18:34:06,396 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:34:06,398 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:34:06,855 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-10 18:34:06,855 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:34:06,886 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:34:06,888 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 18:34:06,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:06 BoogieIcfgContainer [2024-11-10 18:34:06,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:34:06,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:34:06,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:34:06,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:34:06,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:34:05" (1/3) ... [2024-11-10 18:34:06,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce57f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:06, skipping insertion in model container [2024-11-10 18:34:06,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:06" (2/3) ... [2024-11-10 18:34:06,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce57f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:06, skipping insertion in model container [2024-11-10 18:34:06,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:06" (3/3) ... [2024-11-10 18:34:06,899 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-11-10 18:34:06,918 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:34:06,918 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-10 18:34:06,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:34:06,978 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;@25fc1055, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:34:06,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 18:34:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 91 states have (on average 1.5274725274725274) internal successors, (139), 107 states have internal predecessors, (139), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 18:34:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 18:34:06,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:06,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:06,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:07,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash -33419105, now seen corresponding path program 1 times [2024-11-10 18:34:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:07,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500439749] [2024-11-10 18:34:07,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,288 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-10 18:34:07,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:07,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500439749] [2024-11-10 18:34:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500439749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:07,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:07,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:07,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096995417] [2024-11-10 18:34:07,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:07,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:07,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:07,321 INFO L87 Difference]: Start difference. First operand has 119 states, 91 states have (on average 1.5274725274725274) internal successors, (139), 107 states have internal predecessors, (139), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-10 18:34:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:07,541 INFO L93 Difference]: Finished difference Result 294 states and 407 transitions. [2024-11-10 18:34:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:07,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-11-10 18:34:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:07,556 INFO L225 Difference]: With dead ends: 294 [2024-11-10 18:34:07,556 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 18:34:07,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:07,562 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 100 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:07,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 376 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 18:34:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2024-11-10 18:34:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.406015037593985) internal successors, (187), 145 states have internal predecessors, (187), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2024-11-10 18:34:07,616 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 10 [2024-11-10 18:34:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:07,617 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2024-11-10 18:34:07,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-10 18:34:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2024-11-10 18:34:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:34:07,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:07,619 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:07,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:34:07,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:07,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash -739247446, now seen corresponding path program 1 times [2024-11-10 18:34:07,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:07,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352154737] [2024-11-10 18:34:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:34:07,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:07,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352154737] [2024-11-10 18:34:07,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352154737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:07,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:07,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:34:07,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676454444] [2024-11-10 18:34:07,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:07,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:07,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:07,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:07,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:07,722 INFO L87 Difference]: Start difference. First operand 156 states and 200 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, (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-10 18:34:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:07,793 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2024-11-10 18:34:07,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:07,794 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, (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 17 [2024-11-10 18:34:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:07,796 INFO L225 Difference]: With dead ends: 156 [2024-11-10 18:34:07,796 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 18:34:07,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10 18:34:07,798 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:07,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 216 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 18:34:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-10 18:34:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 144 states have internal predecessors, (185), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2024-11-10 18:34:07,816 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 17 [2024-11-10 18:34:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:07,816 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2024-11-10 18:34:07,816 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, (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-10 18:34:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2024-11-10 18:34:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:07,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:07,817 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:07,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:34:07,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:07,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1441834352, now seen corresponding path program 1 times [2024-11-10 18:34:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:07,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225642152] [2024-11-10 18:34:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,928 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-10 18:34:07,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225642152] [2024-11-10 18:34:07,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225642152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:07,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376735752] [2024-11-10 18:34:07,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:07,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:07,935 INFO L87 Difference]: Start difference. First operand 155 states and 198 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, (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-10 18:34:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:08,100 INFO L93 Difference]: Finished difference Result 221 states and 287 transitions. [2024-11-10 18:34:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:08,101 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 18:34:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:08,103 INFO L225 Difference]: With dead ends: 221 [2024-11-10 18:34:08,103 INFO L226 Difference]: Without dead ends: 218 [2024-11-10 18:34:08,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:08,107 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 98 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:08,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 398 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-10 18:34:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2024-11-10 18:34:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 177 states have (on average 1.3898305084745763) internal successors, (246), 187 states have internal predecessors, (246), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 259 transitions. [2024-11-10 18:34:08,134 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 259 transitions. Word has length 18 [2024-11-10 18:34:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:08,134 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 259 transitions. [2024-11-10 18:34:08,134 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, (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-10 18:34:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 259 transitions. [2024-11-10 18:34:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:08,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:08,138 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:08,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:34:08,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:08,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1396028642, now seen corresponding path program 1 times [2024-11-10 18:34:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:08,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380883144] [2024-11-10 18:34:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:08,221 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-10 18:34:08,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:08,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380883144] [2024-11-10 18:34:08,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380883144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:08,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:08,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166821955] [2024-11-10 18:34:08,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:08,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:08,223 INFO L87 Difference]: Start difference. First operand 199 states and 259 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, (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-10 18:34:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:08,346 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2024-11-10 18:34:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:08,346 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 18:34:08,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:08,348 INFO L225 Difference]: With dead ends: 224 [2024-11-10 18:34:08,348 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 18:34:08,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:08,349 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 89 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:08,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 400 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 18:34:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 203. [2024-11-10 18:34:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 181 states have (on average 1.3701657458563536) internal successors, (248), 191 states have internal predecessors, (248), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 261 transitions. [2024-11-10 18:34:08,370 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 261 transitions. Word has length 18 [2024-11-10 18:34:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:08,371 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 261 transitions. [2024-11-10 18:34:08,371 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, (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-10 18:34:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 261 transitions. [2024-11-10 18:34:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:34:08,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:08,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:08,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:34:08,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:08,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:08,374 INFO L85 PathProgramCache]: Analyzing trace with hash -375816078, now seen corresponding path program 1 times [2024-11-10 18:34:08,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:08,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803388951] [2024-11-10 18:34:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:08,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:08,405 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-10 18:34:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803388951] [2024-11-10 18:34:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803388951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:08,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200946454] [2024-11-10 18:34:08,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:08,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:08,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:08,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:08,408 INFO L87 Difference]: Start difference. First operand 203 states and 261 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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-10 18:34:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:08,457 INFO L93 Difference]: Finished difference Result 380 states and 487 transitions. [2024-11-10 18:34:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-10 18:34:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:08,459 INFO L225 Difference]: With dead ends: 380 [2024-11-10 18:34:08,459 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 18:34:08,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:08,461 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 14 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:08,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 217 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 18:34:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2024-11-10 18:34:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 186 states have (on average 1.3440860215053763) internal successors, (250), 196 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 263 transitions. [2024-11-10 18:34:08,472 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 263 transitions. Word has length 17 [2024-11-10 18:34:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:08,472 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 263 transitions. [2024-11-10 18:34:08,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-10 18:34:08,473 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 263 transitions. [2024-11-10 18:34:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:08,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:08,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:08,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:34:08,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1234754389, now seen corresponding path program 1 times [2024-11-10 18:34:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:08,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901031898] [2024-11-10 18:34:08,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:08,570 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-10 18:34:08,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:08,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901031898] [2024-11-10 18:34:08,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901031898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:08,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:08,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:08,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485591269] [2024-11-10 18:34:08,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:08,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:08,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:08,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:08,572 INFO L87 Difference]: Start difference. First operand 208 states and 263 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10 18:34:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:08,705 INFO L93 Difference]: Finished difference Result 391 states and 489 transitions. [2024-11-10 18:34:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:34:08,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 18 [2024-11-10 18:34:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:08,707 INFO L225 Difference]: With dead ends: 391 [2024-11-10 18:34:08,707 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 18:34:08,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10 18:34:08,709 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 134 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:08,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 436 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 18:34:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 221. [2024-11-10 18:34:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 199 states have (on average 1.3316582914572865) internal successors, (265), 209 states have internal predecessors, (265), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 278 transitions. [2024-11-10 18:34:08,727 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 278 transitions. Word has length 18 [2024-11-10 18:34:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:08,727 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 278 transitions. [2024-11-10 18:34:08,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10 18:34:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 278 transitions. [2024-11-10 18:34:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 18:34:08,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:08,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:08,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:34:08,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:08,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1970930279, now seen corresponding path program 1 times [2024-11-10 18:34:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297811759] [2024-11-10 18:34:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297811759] [2024-11-10 18:34:08,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297811759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791995606] [2024-11-10 18:34:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:08,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:08,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:08,802 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-10 18:34:08,803 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-10 18:34:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:08,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:34:08,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:08,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791995606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:08,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:08,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-10 18:34:08,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088943412] [2024-11-10 18:34:08,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:08,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:08,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:08,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:08,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:34:08,918 INFO L87 Difference]: Start difference. First operand 221 states and 278 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-10 18:34:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:08,980 INFO L93 Difference]: Finished difference Result 238 states and 305 transitions. [2024-11-10 18:34:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:08,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 21 [2024-11-10 18:34:08,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:08,981 INFO L225 Difference]: With dead ends: 238 [2024-11-10 18:34:08,982 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 18:34:08,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-10 18:34:08,983 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 8 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:08,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 233 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 18:34:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 216. [2024-11-10 18:34:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 194 states have (on average 1.3298969072164948) internal successors, (258), 204 states have internal predecessors, (258), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 271 transitions. [2024-11-10 18:34:08,996 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 271 transitions. Word has length 21 [2024-11-10 18:34:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:08,997 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 271 transitions. [2024-11-10 18:34:08,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-10 18:34:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 271 transitions. [2024-11-10 18:34:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:34:09,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:09,002 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:09,019 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-10 18:34:09,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:09,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:09,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash -193010727, now seen corresponding path program 1 times [2024-11-10 18:34:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:09,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158674759] [2024-11-10 18:34:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,273 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-10 18:34:09,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158674759] [2024-11-10 18:34:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158674759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:09,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731859107] [2024-11-10 18:34:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:09,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:09,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:09,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:09,276 INFO L87 Difference]: Start difference. First operand 216 states and 271 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-10 18:34:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:09,373 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2024-11-10 18:34:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2024-11-10 18:34:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:09,375 INFO L225 Difference]: With dead ends: 235 [2024-11-10 18:34:09,376 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 18:34:09,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:09,377 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 93 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:09,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 410 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 18:34:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2024-11-10 18:34:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 189 states have (on average 1.3174603174603174) internal successors, (249), 197 states have internal predecessors, (249), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 262 transitions. [2024-11-10 18:34:09,387 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 262 transitions. Word has length 25 [2024-11-10 18:34:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:09,388 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 262 transitions. [2024-11-10 18:34:09,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-10 18:34:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 262 transitions. [2024-11-10 18:34:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:34:09,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:09,389 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:09,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:34:09,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:09,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash -147205017, now seen corresponding path program 1 times [2024-11-10 18:34:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201579056] [2024-11-10 18:34:09,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,458 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-10 18:34:09,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:09,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201579056] [2024-11-10 18:34:09,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201579056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:09,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:09,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:09,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166301424] [2024-11-10 18:34:09,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:09,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:09,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:09,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:09,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:09,461 INFO L87 Difference]: Start difference. First operand 209 states and 262 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-10 18:34:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:09,570 INFO L93 Difference]: Finished difference Result 237 states and 296 transitions. [2024-11-10 18:34:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:09,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2024-11-10 18:34:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:09,572 INFO L225 Difference]: With dead ends: 237 [2024-11-10 18:34:09,572 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 18:34:09,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:09,573 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 86 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:09,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 406 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 18:34:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 213. [2024-11-10 18:34:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 194 states have (on average 1.309278350515464) internal successors, (254), 201 states have internal predecessors, (254), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 267 transitions. [2024-11-10 18:34:09,588 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 267 transitions. Word has length 25 [2024-11-10 18:34:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:09,588 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 267 transitions. [2024-11-10 18:34:09,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-10 18:34:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 267 transitions. [2024-11-10 18:34:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:34:09,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:09,589 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:09,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:34:09,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:09,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash -823293344, now seen corresponding path program 1 times [2024-11-10 18:34:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:09,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141442723] [2024-11-10 18:34:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:34:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141442723] [2024-11-10 18:34:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141442723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:09,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:09,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826262358] [2024-11-10 18:34:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:09,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:09,642 INFO L87 Difference]: Start difference. First operand 213 states and 267 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-10 18:34:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:09,711 INFO L93 Difference]: Finished difference Result 235 states and 298 transitions. [2024-11-10 18:34:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:09,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 25 [2024-11-10 18:34:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:09,712 INFO L225 Difference]: With dead ends: 235 [2024-11-10 18:34:09,712 INFO L226 Difference]: Without dead ends: 234 [2024-11-10 18:34:09,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:09,714 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 8 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:09,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 319 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-10 18:34:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2024-11-10 18:34:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 178 states have (on average 1.303370786516854) internal successors, (232), 184 states have internal predecessors, (232), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 245 transitions. [2024-11-10 18:34:09,725 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 245 transitions. Word has length 25 [2024-11-10 18:34:09,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:09,726 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 245 transitions. [2024-11-10 18:34:09,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-10 18:34:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 245 transitions. [2024-11-10 18:34:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 18:34:09,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:09,728 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:09,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:34:09,729 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:09,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash -589923992, now seen corresponding path program 1 times [2024-11-10 18:34:09,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:09,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486625792] [2024-11-10 18:34:09,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:34:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486625792] [2024-11-10 18:34:09,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486625792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060944895] [2024-11-10 18:34:09,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:09,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:09,982 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-10 18:34:09,983 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-10 18:34:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:34:10,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 18:34:10,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:10,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060944895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:10,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:10,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-10 18:34:10,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287060498] [2024-11-10 18:34:10,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:10,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:34:10,095 INFO L87 Difference]: Start difference. First operand 196 states and 245 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:34:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:10,165 INFO L93 Difference]: Finished difference Result 196 states and 245 transitions. [2024-11-10 18:34:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:34:10,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-10 18:34:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:10,167 INFO L225 Difference]: With dead ends: 196 [2024-11-10 18:34:10,169 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 18:34:10,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:34:10,170 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:10,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 407 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 18:34:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-10 18:34:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.297752808988764) internal successors, (231), 183 states have internal predecessors, (231), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 244 transitions. [2024-11-10 18:34:10,179 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 244 transitions. Word has length 43 [2024-11-10 18:34:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:10,180 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 244 transitions. [2024-11-10 18:34:10,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:34:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 244 transitions. [2024-11-10 18:34:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 18:34:10,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:10,182 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:10,199 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-10 18:34:10,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 18:34:10,383 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:10,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:10,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1107774471, now seen corresponding path program 1 times [2024-11-10 18:34:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180563006] [2024-11-10 18:34:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:34:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:10,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:10,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180563006] [2024-11-10 18:34:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180563006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:10,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830310315] [2024-11-10 18:34:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:10,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:10,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:10,656 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-10 18:34:10,657 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-10 18:34:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 18:34:10,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:10,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:34:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830310315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:34:10,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:34:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-10 18:34:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899542084] [2024-11-10 18:34:10,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:34:10,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 18:34:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:10,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 18:34:10,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:34:10,921 INFO L87 Difference]: Start difference. First operand 195 states and 244 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 18:34:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:11,099 INFO L93 Difference]: Finished difference Result 273 states and 340 transitions. [2024-11-10 18:34:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:34:11,099 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2024-11-10 18:34:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:11,101 INFO L225 Difference]: With dead ends: 273 [2024-11-10 18:34:11,101 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 18:34:11,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-10 18:34:11,102 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 9 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:11,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1272 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 18:34:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2024-11-10 18:34:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 187 states have (on average 1.2887700534759359) internal successors, (241), 193 states have internal predecessors, (241), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 18:34:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 259 transitions. [2024-11-10 18:34:11,115 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 259 transitions. Word has length 44 [2024-11-10 18:34:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:11,115 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 259 transitions. [2024-11-10 18:34:11,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 18:34:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 259 transitions. [2024-11-10 18:34:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 18:34:11,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:11,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:11,132 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-10 18:34:11,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:11,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:11,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash -264777092, now seen corresponding path program 1 times [2024-11-10 18:34:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:11,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744729789] [2024-11-10 18:34:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 18:34:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744729789] [2024-11-10 18:34:11,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744729789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:11,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:11,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:34:11,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839795661] [2024-11-10 18:34:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:11,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:34:11,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:11,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:34:11,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:34:11,479 INFO L87 Difference]: Start difference. First operand 208 states and 259 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:11,566 INFO L93 Difference]: Finished difference Result 292 states and 360 transitions. [2024-11-10 18:34:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:34:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-10 18:34:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:11,568 INFO L225 Difference]: With dead ends: 292 [2024-11-10 18:34:11,568 INFO L226 Difference]: Without dead ends: 232 [2024-11-10 18:34:11,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:34:11,570 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 7 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:11,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 751 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-10 18:34:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 219. [2024-11-10 18:34:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 195 states have (on average 1.2769230769230768) internal successors, (249), 202 states have internal predecessors, (249), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 18:34:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 271 transitions. [2024-11-10 18:34:11,586 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 271 transitions. Word has length 49 [2024-11-10 18:34:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:11,586 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 271 transitions. [2024-11-10 18:34:11,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 271 transitions. [2024-11-10 18:34:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 18:34:11,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:11,587 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:11,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:34:11,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:11,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1650267106, now seen corresponding path program 1 times [2024-11-10 18:34:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:11,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629268319] [2024-11-10 18:34:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:11,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 18:34:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 18:34:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629268319] [2024-11-10 18:34:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629268319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:11,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:34:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162147755] [2024-11-10 18:34:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:34:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:34:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:34:11,787 INFO L87 Difference]: Start difference. First operand 219 states and 271 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:11,932 INFO L93 Difference]: Finished difference Result 329 states and 404 transitions. [2024-11-10 18:34:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:34:11,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2024-11-10 18:34:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:11,934 INFO L225 Difference]: With dead ends: 329 [2024-11-10 18:34:11,934 INFO L226 Difference]: Without dead ends: 267 [2024-11-10 18:34:11,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:34:11,935 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 115 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:11,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 873 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-10 18:34:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 259. [2024-11-10 18:34:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 238 states have internal predecessors, (296), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-10 18:34:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 323 transitions. [2024-11-10 18:34:11,949 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 323 transitions. Word has length 52 [2024-11-10 18:34:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:11,950 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 323 transitions. [2024-11-10 18:34:11,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 323 transitions. [2024-11-10 18:34:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 18:34:11,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:11,951 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:11,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 18:34:11,951 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:11,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1800228319, now seen corresponding path program 1 times [2024-11-10 18:34:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:11,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660476398] [2024-11-10 18:34:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 18:34:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 18:34:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660476398] [2024-11-10 18:34:12,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660476398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965895859] [2024-11-10 18:34:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:12,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:12,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:12,144 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-10 18:34:12,146 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-10 18:34:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 18:34:12,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:12,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965895859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:12,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:12,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 13 [2024-11-10 18:34:12,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191288101] [2024-11-10 18:34:12,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:12,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:34:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:12,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:34:12,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:34:12,293 INFO L87 Difference]: Start difference. First operand 259 states and 323 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:12,401 INFO L93 Difference]: Finished difference Result 271 states and 329 transitions. [2024-11-10 18:34:12,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:34:12,402 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2024-11-10 18:34:12,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:12,403 INFO L225 Difference]: With dead ends: 271 [2024-11-10 18:34:12,403 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 18:34:12,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:34:12,404 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 3 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:12,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 876 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 18:34:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-10 18:34:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 187 states have (on average 1.2780748663101604) internal successors, (239), 193 states have internal predecessors, (239), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 18:34:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 257 transitions. [2024-11-10 18:34:12,417 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 257 transitions. Word has length 52 [2024-11-10 18:34:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:12,417 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 257 transitions. [2024-11-10 18:34:12,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 257 transitions. [2024-11-10 18:34:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 18:34:12,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:12,418 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:12,436 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-10 18:34:12,622 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,SelfDestructingSolverStorable14 [2024-11-10 18:34:12,623 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:12,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1841873260, now seen corresponding path program 1 times [2024-11-10 18:34:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:12,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630812401] [2024-11-10 18:34:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 18:34:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 18:34:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630812401] [2024-11-10 18:34:12,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630812401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241604772] [2024-11-10 18:34:12,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:12,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:12,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:12,776 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-10 18:34:12,778 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-10 18:34:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 18:34:12,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:12,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:34:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:13,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241604772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:34:13,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:34:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2024-11-10 18:34:13,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009223025] [2024-11-10 18:34:13,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:34:13,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 18:34:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:13,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 18:34:13,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2024-11-10 18:34:13,326 INFO L87 Difference]: Start difference. First operand 208 states and 257 transitions. Second operand has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 18 states have internal predecessors, (67), 6 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-10 18:34:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:13,908 INFO L93 Difference]: Finished difference Result 381 states and 464 transitions. [2024-11-10 18:34:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 18:34:13,909 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 18 states have internal predecessors, (67), 6 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) Word has length 57 [2024-11-10 18:34:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:13,911 INFO L225 Difference]: With dead ends: 381 [2024-11-10 18:34:13,911 INFO L226 Difference]: Without dead ends: 271 [2024-11-10 18:34:13,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 18:34:13,913 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 265 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:13,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 2293 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 18:34:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-10 18:34:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 247. [2024-11-10 18:34:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 224 states have (on average 1.2723214285714286) internal successors, (285), 229 states have internal predecessors, (285), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 18:34:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2024-11-10 18:34:13,928 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 57 [2024-11-10 18:34:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:13,928 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2024-11-10 18:34:13,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 18 states have internal predecessors, (67), 6 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-10 18:34:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2024-11-10 18:34:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 18:34:13,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:13,929 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:13,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 18:34:14,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 18:34:14,132 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:14,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1051759717, now seen corresponding path program 2 times [2024-11-10 18:34:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839023175] [2024-11-10 18:34:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:14,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:34:14,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839023175] [2024-11-10 18:34:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839023175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948007943] [2024-11-10 18:34:14,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:34:14,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:14,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:14,298 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-10 18:34:14,298 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-10 18:34:14,353 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:34:14,353 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:34:14,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 18:34:14,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:34:14,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:14,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948007943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:14,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:14,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-11-10 18:34:14,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874939574] [2024-11-10 18:34:14,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:14,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:34:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:14,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:34:14,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:34:14,557 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:14,854 INFO L93 Difference]: Finished difference Result 433 states and 539 transitions. [2024-11-10 18:34:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:34:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-10 18:34:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:14,856 INFO L225 Difference]: With dead ends: 433 [2024-11-10 18:34:14,856 INFO L226 Difference]: Without dead ends: 348 [2024-11-10 18:34:14,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:34:14,857 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 138 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:14,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1247 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:34:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-10 18:34:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 290. [2024-11-10 18:34:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 265 states have (on average 1.2867924528301886) internal successors, (341), 270 states have internal predecessors, (341), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 18:34:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 366 transitions. [2024-11-10 18:34:14,870 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 366 transitions. Word has length 54 [2024-11-10 18:34:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:14,870 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 366 transitions. [2024-11-10 18:34:14,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 366 transitions. [2024-11-10 18:34:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 18:34:14,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:14,871 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:14,888 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-10 18:34:15,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 18:34:15,076 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:15,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 207287846, now seen corresponding path program 1 times [2024-11-10 18:34:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:15,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189759436] [2024-11-10 18:34:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:34:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189759436] [2024-11-10 18:34:15,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189759436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:15,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:15,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 18:34:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671962235] [2024-11-10 18:34:15,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:15,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:34:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:15,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:34:15,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:34:15,645 INFO L87 Difference]: Start difference. First operand 290 states and 366 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:15,995 INFO L93 Difference]: Finished difference Result 334 states and 420 transitions. [2024-11-10 18:34:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 18:34:15,996 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-10 18:34:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:15,997 INFO L225 Difference]: With dead ends: 334 [2024-11-10 18:34:15,997 INFO L226 Difference]: Without dead ends: 333 [2024-11-10 18:34:15,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:34:15,998 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 166 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:15,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 864 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:34:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-10 18:34:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 289. [2024-11-10 18:34:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 265 states have (on average 1.2754716981132075) internal successors, (338), 269 states have internal predecessors, (338), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 18:34:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 363 transitions. [2024-11-10 18:34:16,011 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 363 transitions. Word has length 54 [2024-11-10 18:34:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:16,011 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 363 transitions. [2024-11-10 18:34:16,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 363 transitions. [2024-11-10 18:34:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 18:34:16,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:16,013 INFO L215 NwaCegarLoop]: trace histogram [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, 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-10 18:34:16,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 18:34:16,013 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:16,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:16,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1787211726, now seen corresponding path program 1 times [2024-11-10 18:34:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:16,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641153213] [2024-11-10 18:34:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:34:16,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:16,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641153213] [2024-11-10 18:34:16,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641153213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:16,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:34:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387191744] [2024-11-10 18:34:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:16,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:16,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:16,081 INFO L87 Difference]: Start difference. First operand 289 states and 363 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:16,121 INFO L93 Difference]: Finished difference Result 295 states and 369 transitions. [2024-11-10 18:34:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:16,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2024-11-10 18:34:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:16,123 INFO L225 Difference]: With dead ends: 295 [2024-11-10 18:34:16,123 INFO L226 Difference]: Without dead ends: 293 [2024-11-10 18:34:16,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10 18:34:16,124 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:16,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 168 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-10 18:34:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2024-11-10 18:34:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 265 states have (on average 1.2528301886792452) internal successors, (332), 267 states have internal predecessors, (332), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 18:34:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 357 transitions. [2024-11-10 18:34:16,137 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 357 transitions. Word has length 63 [2024-11-10 18:34:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:16,137 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 357 transitions. [2024-11-10 18:34:16,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 357 transitions. [2024-11-10 18:34:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 18:34:16,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:16,138 INFO L215 NwaCegarLoop]: trace histogram [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, 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-10 18:34:16,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 18:34:16,139 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:16,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash -431011273, now seen corresponding path program 1 times [2024-11-10 18:34:16,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:16,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059330877] [2024-11-10 18:34:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:16,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:34:16,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059330877] [2024-11-10 18:34:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059330877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:16,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:16,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:34:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857619849] [2024-11-10 18:34:16,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:16,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:34:16,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:16,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:34:16,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:34:16,293 INFO L87 Difference]: Start difference. First operand 287 states and 357 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:16,442 INFO L93 Difference]: Finished difference Result 517 states and 651 transitions. [2024-11-10 18:34:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:34:16,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2024-11-10 18:34:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:16,444 INFO L225 Difference]: With dead ends: 517 [2024-11-10 18:34:16,444 INFO L226 Difference]: Without dead ends: 408 [2024-11-10 18:34:16,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:34:16,445 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 37 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:16,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 704 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-10 18:34:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 332. [2024-11-10 18:34:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 307 states have (on average 1.237785016286645) internal successors, (380), 309 states have internal predecessors, (380), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2024-11-10 18:34:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 411 transitions. [2024-11-10 18:34:16,461 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 411 transitions. Word has length 64 [2024-11-10 18:34:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:16,461 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 411 transitions. [2024-11-10 18:34:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 411 transitions. [2024-11-10 18:34:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 18:34:16,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:16,462 INFO L215 NwaCegarLoop]: trace histogram [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, 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-10 18:34:16,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 18:34:16,463 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:16,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash -330497491, now seen corresponding path program 1 times [2024-11-10 18:34:16,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:16,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816472993] [2024-11-10 18:34:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:34:16,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:16,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816472993] [2024-11-10 18:34:16,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816472993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:16,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:16,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:34:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104659392] [2024-11-10 18:34:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:16,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:16,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:16,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:16,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:16,547 INFO L87 Difference]: Start difference. First operand 332 states and 411 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:16,588 INFO L93 Difference]: Finished difference Result 351 states and 434 transitions. [2024-11-10 18:34:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:16,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 65 [2024-11-10 18:34:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:16,590 INFO L225 Difference]: With dead ends: 351 [2024-11-10 18:34:16,590 INFO L226 Difference]: Without dead ends: 345 [2024-11-10 18:34:16,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10 18:34:16,591 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 21 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:16,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 171 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-10 18:34:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 339. [2024-11-10 18:34:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 313 states have (on average 1.220447284345048) internal successors, (382), 314 states have internal predecessors, (382), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-10 18:34:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 417 transitions. [2024-11-10 18:34:16,605 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 417 transitions. Word has length 65 [2024-11-10 18:34:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:16,605 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 417 transitions. [2024-11-10 18:34:16,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 417 transitions. [2024-11-10 18:34:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 18:34:16,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:16,607 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:16,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 18:34:16,607 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:16,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1113209713, now seen corresponding path program 1 times [2024-11-10 18:34:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:16,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373576659] [2024-11-10 18:34:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 18:34:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 18:34:16,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:16,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373576659] [2024-11-10 18:34:16,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373576659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:16,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515203345] [2024-11-10 18:34:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:16,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:16,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:16,864 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-10 18:34:16,866 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-10 18:34:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 18:34:16,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 18:34:17,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515203345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:17,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 15 [2024-11-10 18:34:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631348079] [2024-11-10 18:34:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:17,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:34:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:34:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:34:17,082 INFO L87 Difference]: Start difference. First operand 339 states and 417 transitions. Second operand has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:17,302 INFO L93 Difference]: Finished difference Result 565 states and 692 transitions. [2024-11-10 18:34:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:34:17,303 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 74 [2024-11-10 18:34:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:17,305 INFO L225 Difference]: With dead ends: 565 [2024-11-10 18:34:17,305 INFO L226 Difference]: Without dead ends: 443 [2024-11-10 18:34:17,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-10 18:34:17,306 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 67 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:17,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1016 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:34:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-10 18:34:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 404. [2024-11-10 18:34:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 370 states have (on average 1.2135135135135136) internal successors, (449), 371 states have internal predecessors, (449), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 23 states have call predecessors, (24), 21 states have call successors, (24) [2024-11-10 18:34:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 497 transitions. [2024-11-10 18:34:17,331 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 497 transitions. Word has length 74 [2024-11-10 18:34:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:17,331 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 497 transitions. [2024-11-10 18:34:17,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 497 transitions. [2024-11-10 18:34:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 18:34:17,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:17,333 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:17,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 18:34:17,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:17,534 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:17,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash -226275593, now seen corresponding path program 1 times [2024-11-10 18:34:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:17,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719133758] [2024-11-10 18:34:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 18:34:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:34:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:34:17,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:17,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719133758] [2024-11-10 18:34:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719133758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:17,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:17,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998121043] [2024-11-10 18:34:17,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:17,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:17,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:17,639 INFO L87 Difference]: Start difference. First operand 404 states and 497 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:34:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:17,673 INFO L93 Difference]: Finished difference Result 573 states and 706 transitions. [2024-11-10 18:34:17,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:17,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2024-11-10 18:34:17,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:17,676 INFO L225 Difference]: With dead ends: 573 [2024-11-10 18:34:17,676 INFO L226 Difference]: Without dead ends: 407 [2024-11-10 18:34:17,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:17,677 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:17,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-10 18:34:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 392. [2024-11-10 18:34:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 359 states have (on average 1.2116991643454038) internal successors, (435), 360 states have internal predecessors, (435), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 22 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-10 18:34:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 481 transitions. [2024-11-10 18:34:17,700 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 481 transitions. Word has length 75 [2024-11-10 18:34:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:17,701 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 481 transitions. [2024-11-10 18:34:17,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:34:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 481 transitions. [2024-11-10 18:34:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 18:34:17,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:17,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 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-10 18:34:17,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 18:34:17,704 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:17,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:17,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1801693919, now seen corresponding path program 1 times [2024-11-10 18:34:17,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:17,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709182987] [2024-11-10 18:34:17,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:17,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 18:34:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 18:34:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 18:34:18,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709182987] [2024-11-10 18:34:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709182987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:18,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 18:34:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078922017] [2024-11-10 18:34:18,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:18,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:34:18,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:18,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:34:18,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:34:18,026 INFO L87 Difference]: Start difference. First operand 392 states and 481 transitions. Second operand has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:18,295 INFO L93 Difference]: Finished difference Result 416 states and 511 transitions. [2024-11-10 18:34:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 18:34:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 76 [2024-11-10 18:34:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:18,297 INFO L225 Difference]: With dead ends: 416 [2024-11-10 18:34:18,297 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:34:18,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:34:18,298 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 122 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:18,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 902 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:34:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:34:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:34:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:34:18,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2024-11-10 18:34:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:18,300 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:34:18,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:34:18,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:34:18,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-11-10 18:34:18,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-11-10 18:34:18,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-11-10 18:34:18,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-11-10 18:34:18,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-11-10 18:34:18,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-11-10 18:34:18,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-11-10 18:34:18,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-11-10 18:34:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-11-10 18:34:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-11-10 18:34:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-11-10 18:34:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-11-10 18:34:18,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-11-10 18:34:18,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-11-10 18:34:18,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-11-10 18:34:18,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-11-10 18:34:18,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 18:34:18,309 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:18,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:34:19,327 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:34:19,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:34:19 BoogieIcfgContainer [2024-11-10 18:34:19,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:34:19,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:34:19,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:34:19,352 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:34:19,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:06" (3/4) ... [2024-11-10 18:34:19,356 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:34:19,359 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-11-10 18:34:19,360 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure addflt [2024-11-10 18:34:19,360 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 18:34:19,367 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-10 18:34:19,368 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 18:34:19,369 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 18:34:19,369 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:34:19,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:34:19,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:34:19,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:34:19,477 INFO L158 Benchmark]: Toolchain (without parser) took 13742.52ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 81.3MB in the beginning and 111.8MB in the end (delta: -30.5MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2024-11-10 18:34:19,477 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 113.2MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:19,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.05ms. Allocated memory is still 151.0MB. Free memory was 81.1MB in the beginning and 65.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 18:34:19,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.69ms. Allocated memory is still 151.0MB. Free memory was 65.9MB in the beginning and 64.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:19,477 INFO L158 Benchmark]: Boogie Preprocessor took 69.09ms. Allocated memory is still 151.0MB. Free memory was 64.3MB in the beginning and 62.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:34:19,478 INFO L158 Benchmark]: IcfgBuilder took 682.86ms. Allocated memory is still 151.0MB. Free memory was 62.3MB in the beginning and 106.2MB in the end (delta: -44.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 18:34:19,478 INFO L158 Benchmark]: TraceAbstraction took 12460.07ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 105.6MB in the beginning and 119.1MB in the end (delta: -13.6MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. [2024-11-10 18:34:19,478 INFO L158 Benchmark]: Witness Printer took 124.03ms. Allocated memory is still 237.0MB. Free memory was 119.1MB in the beginning and 111.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:34:19,483 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 113.2MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.05ms. Allocated memory is still 151.0MB. Free memory was 81.1MB in the beginning and 65.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.69ms. Allocated memory is still 151.0MB. Free memory was 65.9MB in the beginning and 64.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.09ms. Allocated memory is still 151.0MB. Free memory was 64.3MB in the beginning and 62.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 682.86ms. Allocated memory is still 151.0MB. Free memory was 62.3MB in the beginning and 106.2MB in the end (delta: -44.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12460.07ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 105.6MB in the beginning and 119.1MB in the end (delta: -13.6MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. * Witness Printer took 124.03ms. Allocated memory is still 237.0MB. Free memory was 119.1MB in the beginning and 111.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 119 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 24, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1642 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1607 mSDsluCounter, 15172 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12477 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3451 IncrementalHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 2695 mSDtfsCounter, 3451 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 782 GetRequests, 587 SyntacticMatches, 6 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=22, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 483 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1361 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1429 ConstructedInterpolants, 4 QuantifiedInterpolants, 2798 SizeOfPredicates, 12 NumberOfNonLiveVariables, 941 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 33 InterpolantComputations, 22 PerfectInterpolantSequences, 417/446 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 38]: Location Invariant Derived location invariant: null - InvariantResult [Line: 58]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 25]: Procedure Contract for base2flt Derived contract for procedure base2flt. Requires: ((e <= 127) && (0 <= ((long long) 128 + e))) Ensures: ((e <= 127) && (0 <= ((long long) 128 + e))) - ProcedureContractResult [Line: 16]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-10 18:34:19,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE