./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_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-dev-4a390ef-m [2024-10-24 19:35:14,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:35:14,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 19:35:14,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:35:14,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:35:14,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:35:14,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:35:14,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:35:14,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:35:14,971 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:35:14,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:35:14,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:35:14,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:35:14,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:35:14,973 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:35:14,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:35:14,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 19:35:14,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:35:14,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:35:14,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:35:14,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:35:14,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 19:35:14,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:35:14,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 19:35:14,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:35:14,978 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 19:35:14,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:35:14,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:35:14,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 19:35:14,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:35:14,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:35:14,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:35:14,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:35:14,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:35:14,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:35:14,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:35:14,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:35:14,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 19:35:14,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:35:14,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:35:14,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:35:14,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:35:14,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:35:14,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:35:14,986 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-10-24 19:35:15,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:35:15,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:35:15,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:35:15,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:35:15,421 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:35:15,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-10-24 19:35:17,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:35:17,605 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:35:17,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-10-24 19:35:17,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d360417b/ed87af0c958e4336a045bcb903fa67a8/FLAGe9629492f [2024-10-24 19:35:17,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d360417b/ed87af0c958e4336a045bcb903fa67a8 [2024-10-24 19:35:17,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:35:17,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:35:17,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:35:17,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:35:18,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:35:18,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:35:17" (1/1) ... [2024-10-24 19:35:18,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7399588d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18, skipping insertion in model container [2024-10-24 19:35:18,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:35:17" (1/1) ... [2024-10-24 19:35:18,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:35:18,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:35:18,297 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:35:18,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:35:18,339 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:35:18,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18 WrapperNode [2024-10-24 19:35:18,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:35:18,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:35:18,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:35:18,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:35:18,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,378 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-10-24 19:35:18,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:35:18,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:35:18,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:35:18,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:35:18,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,420 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 19:35:18,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:35:18,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:35:18,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:35:18,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:35:18,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (1/1) ... [2024-10-24 19:35:18,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:35:18,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:18,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:35:18,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:35:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:35:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:35:18,552 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-24 19:35:18,552 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-24 19:35:18,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:35:18,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:35:18,552 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-10-24 19:35:18,552 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-10-24 19:35:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 19:35:18,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 19:35:18,618 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:35:18,620 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:35:19,135 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-10-24 19:35:19,137 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:35:19,163 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:35:19,163 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 19:35:19,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:19 BoogieIcfgContainer [2024-10-24 19:35:19,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:35:19,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:35:19,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:35:19,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:35:19,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:35:17" (1/3) ... [2024-10-24 19:35:19,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768d4f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:35:19, skipping insertion in model container [2024-10-24 19:35:19,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:18" (2/3) ... [2024-10-24 19:35:19,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768d4f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:35:19, skipping insertion in model container [2024-10-24 19:35:19,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:19" (3/3) ... [2024-10-24 19:35:19,171 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-10-24 19:35:19,186 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:35:19,186 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-24 19:35:19,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:35:19,237 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;@e9a3c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:35:19,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-24 19:35:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 74 states have (on average 1.6486486486486487) internal successors, (122), 90 states have internal predecessors, (122), 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-10-24 19:35:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 19:35:19,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:19,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:19,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:19,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1450738334, now seen corresponding path program 1 times [2024-10-24 19:35:19,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:19,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418829486] [2024-10-24 19:35:19,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:19,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418829486] [2024-10-24 19:35:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418829486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:19,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:19,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105114022] [2024-10-24 19:35:19,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:19,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:19,745 INFO L87 Difference]: Start difference. First operand has 102 states, 74 states have (on average 1.6486486486486487) internal successors, (122), 90 states have internal predecessors, (122), 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 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:19,902 INFO L93 Difference]: Finished difference Result 249 states and 362 transitions. [2024-10-24 19:35:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:19,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 19:35:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:19,915 INFO L225 Difference]: With dead ends: 249 [2024-10-24 19:35:19,915 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 19:35:19,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:19,924 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 82 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:19,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 324 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 19:35:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2024-10-24 19:35:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.490909090909091) internal successors, (164), 122 states have internal predecessors, (164), 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-10-24 19:35:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2024-10-24 19:35:19,999 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 8 [2024-10-24 19:35:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:20,000 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2024-10-24 19:35:20,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2024-10-24 19:35:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 19:35:20,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:20,003 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:20,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:35:20,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:20,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1737014542, now seen corresponding path program 1 times [2024-10-24 19:35:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:20,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320455421] [2024-10-24 19:35:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:20,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:35:20,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320455421] [2024-10-24 19:35:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320455421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:20,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:20,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:35:20,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359709067] [2024-10-24 19:35:20,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:20,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:20,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:20,129 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:20,177 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2024-10-24 19:35:20,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:20,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2024-10-24 19:35:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:20,179 INFO L225 Difference]: With dead ends: 133 [2024-10-24 19:35:20,179 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 19:35:20,179 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-10-24 19:35:20,180 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:20,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 200 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 19:35:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-24 19:35:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.4727272727272727) internal successors, (162), 121 states have internal predecessors, (162), 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-10-24 19:35:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2024-10-24 19:35:20,207 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 14 [2024-10-24 19:35:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:20,207 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2024-10-24 19:35:20,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2024-10-24 19:35:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 19:35:20,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:20,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:20,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:35:20,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:20,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:20,209 INFO L85 PathProgramCache]: Analyzing trace with hash -613983198, now seen corresponding path program 1 times [2024-10-24 19:35:20,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:20,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754433281] [2024-10-24 19:35:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:20,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:20,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754433281] [2024-10-24 19:35:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754433281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:20,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:20,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:20,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128492711] [2024-10-24 19:35:20,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:20,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:20,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:20,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:20,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:20,297 INFO L87 Difference]: Start difference. First operand 132 states and 175 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:20,338 INFO L93 Difference]: Finished difference Result 246 states and 326 transitions. [2024-10-24 19:35:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:20,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 19:35:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:20,340 INFO L225 Difference]: With dead ends: 246 [2024-10-24 19:35:20,340 INFO L226 Difference]: Without dead ends: 144 [2024-10-24 19:35:20,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:20,342 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 197 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-10-24 19:35:20,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 197 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-24 19:35:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2024-10-24 19:35:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.456140350877193) internal successors, (166), 125 states have internal predecessors, (166), 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-10-24 19:35:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 179 transitions. [2024-10-24 19:35:20,351 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 179 transitions. Word has length 13 [2024-10-24 19:35:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:20,351 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 179 transitions. [2024-10-24 19:35:20,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 179 transitions. [2024-10-24 19:35:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 19:35:20,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:20,352 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:20,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:35:20,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:20,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2015751459, now seen corresponding path program 1 times [2024-10-24 19:35:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:20,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008411765] [2024-10-24 19:35:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008411765] [2024-10-24 19:35:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008411765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839276775] [2024-10-24 19:35:20,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:20,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:20,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:20,419 INFO L87 Difference]: Start difference. First operand 136 states and 179 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:20,513 INFO L93 Difference]: Finished difference Result 193 states and 256 transitions. [2024-10-24 19:35:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:20,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-24 19:35:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:20,516 INFO L225 Difference]: With dead ends: 193 [2024-10-24 19:35:20,516 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 19:35:20,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:20,519 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:20,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 374 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 19:35:20,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2024-10-24 19:35:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.4533333333333334) internal successors, (218), 161 states have internal predecessors, (218), 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-10-24 19:35:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 231 transitions. [2024-10-24 19:35:20,550 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 231 transitions. Word has length 15 [2024-10-24 19:35:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:20,550 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 231 transitions. [2024-10-24 19:35:20,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 231 transitions. [2024-10-24 19:35:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 19:35:20,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:20,558 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:20,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:35:20,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:20,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:20,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1987124103, now seen corresponding path program 1 times [2024-10-24 19:35:20,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:20,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140546564] [2024-10-24 19:35:20,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:20,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:20,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140546564] [2024-10-24 19:35:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140546564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:20,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:20,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:20,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630400765] [2024-10-24 19:35:20,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:20,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:20,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:20,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:20,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:20,664 INFO L87 Difference]: Start difference. First operand 173 states and 231 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:20,758 INFO L93 Difference]: Finished difference Result 194 states and 256 transitions. [2024-10-24 19:35:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:20,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-24 19:35:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:20,760 INFO L225 Difference]: With dead ends: 194 [2024-10-24 19:35:20,761 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 19:35:20,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:20,763 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 76 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:20,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 369 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 19:35:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2024-10-24 19:35:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 152 states have (on average 1.4210526315789473) internal successors, (216), 162 states have internal predecessors, (216), 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-10-24 19:35:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 229 transitions. [2024-10-24 19:35:20,787 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 229 transitions. Word has length 15 [2024-10-24 19:35:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:20,787 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 229 transitions. [2024-10-24 19:35:20,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2024-10-24 19:35:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 19:35:20,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:20,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:20,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:35:20,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:20,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1853555128, now seen corresponding path program 1 times [2024-10-24 19:35:20,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:20,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910008547] [2024-10-24 19:35:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:20,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910008547] [2024-10-24 19:35:20,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910008547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:20,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984729788] [2024-10-24 19:35:20,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:20,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:20,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:20,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:20,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:20,925 INFO L87 Difference]: Start difference. First operand 174 states and 229 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:21,051 INFO L93 Difference]: Finished difference Result 327 states and 425 transitions. [2024-10-24 19:35:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:35:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 19:35:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:21,059 INFO L225 Difference]: With dead ends: 327 [2024-10-24 19:35:21,060 INFO L226 Difference]: Without dead ends: 197 [2024-10-24 19:35:21,060 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-10-24 19:35:21,061 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 123 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:21,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 309 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-24 19:35:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2024-10-24 19:35:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 162 states have (on average 1.4074074074074074) internal successors, (228), 172 states have internal predecessors, (228), 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-10-24 19:35:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 241 transitions. [2024-10-24 19:35:21,078 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 241 transitions. Word has length 14 [2024-10-24 19:35:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:21,078 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 241 transitions. [2024-10-24 19:35:21,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 241 transitions. [2024-10-24 19:35:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 19:35:21,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:21,080 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:21,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:35:21,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:21,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash 279207480, now seen corresponding path program 1 times [2024-10-24 19:35:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979525172] [2024-10-24 19:35:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:21,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:21,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:21,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979525172] [2024-10-24 19:35:21,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979525172] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:21,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048157113] [2024-10-24 19:35:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:21,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:21,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:21,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:35:21,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 19:35:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:21,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:35:21,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:21,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:21,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048157113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:21,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:35:21,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-24 19:35:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466987053] [2024-10-24 19:35:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:21,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:21,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:21,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:21,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:35:21,428 INFO L87 Difference]: Start difference. First operand 184 states and 241 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:21,711 INFO L93 Difference]: Finished difference Result 201 states and 268 transitions. [2024-10-24 19:35:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:21,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 19:35:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:21,713 INFO L225 Difference]: With dead ends: 201 [2024-10-24 19:35:21,713 INFO L226 Difference]: Without dead ends: 200 [2024-10-24 19:35:21,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:35:21,713 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 8 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:21,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 214 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 19:35:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-24 19:35:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2024-10-24 19:35:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 157 states have (on average 1.4076433121019107) internal successors, (221), 167 states have internal predecessors, (221), 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-10-24 19:35:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2024-10-24 19:35:21,731 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 16 [2024-10-24 19:35:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:21,731 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2024-10-24 19:35:21,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2024-10-24 19:35:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 19:35:21,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:21,732 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:21,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 19:35:21,935 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-10-24 19:35:21,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:21,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1959788621, now seen corresponding path program 1 times [2024-10-24 19:35:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:21,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157104671] [2024-10-24 19:35:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 19:35:22,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157104671] [2024-10-24 19:35:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157104671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:22,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:22,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:22,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276453306] [2024-10-24 19:35:22,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:22,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:22,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:22,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:22,053 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 19:35:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:22,145 INFO L93 Difference]: Finished difference Result 204 states and 266 transitions. [2024-10-24 19:35:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-24 19:35:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:22,146 INFO L225 Difference]: With dead ends: 204 [2024-10-24 19:35:22,146 INFO L226 Difference]: Without dead ends: 202 [2024-10-24 19:35:22,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:22,147 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 73 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:22,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 369 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-24 19:35:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 183. [2024-10-24 19:35:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3888888888888888) internal successors, (225), 171 states have internal predecessors, (225), 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-10-24 19:35:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 238 transitions. [2024-10-24 19:35:22,162 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 238 transitions. Word has length 21 [2024-10-24 19:35:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 238 transitions. [2024-10-24 19:35:22,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 19:35:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 238 transitions. [2024-10-24 19:35:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 19:35:22,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:22,165 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:22,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:35:22,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:22,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1931161265, now seen corresponding path program 1 times [2024-10-24 19:35:22,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:22,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993006244] [2024-10-24 19:35:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 19:35:22,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:22,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993006244] [2024-10-24 19:35:22,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993006244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:22,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:22,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:22,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914142430] [2024-10-24 19:35:22,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:22,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:22,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:22,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:22,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:22,222 INFO L87 Difference]: Start difference. First operand 183 states and 238 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 19:35:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:22,305 INFO L93 Difference]: Finished difference Result 200 states and 260 transitions. [2024-10-24 19:35:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-24 19:35:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:22,307 INFO L225 Difference]: With dead ends: 200 [2024-10-24 19:35:22,307 INFO L226 Difference]: Without dead ends: 198 [2024-10-24 19:35:22,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:22,308 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 74 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:22,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 365 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-24 19:35:22,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 176. [2024-10-24 19:35:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.3821656050955413) internal successors, (217), 164 states have internal predecessors, (217), 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-10-24 19:35:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 230 transitions. [2024-10-24 19:35:22,318 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 230 transitions. Word has length 21 [2024-10-24 19:35:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:22,319 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 230 transitions. [2024-10-24 19:35:22,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 19:35:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2024-10-24 19:35:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 19:35:22,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:22,320 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:22,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:35:22,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:22,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash -453038180, now seen corresponding path program 1 times [2024-10-24 19:35:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:22,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228077463] [2024-10-24 19:35:22,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:22,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:35:22,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228077463] [2024-10-24 19:35:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228077463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:22,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:22,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:22,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955368075] [2024-10-24 19:35:22,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:22,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:22,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:22,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:22,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:22,350 INFO L87 Difference]: Start difference. First operand 176 states and 230 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:22,386 INFO L93 Difference]: Finished difference Result 196 states and 259 transitions. [2024-10-24 19:35:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:22,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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 20 [2024-10-24 19:35:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:22,388 INFO L225 Difference]: With dead ends: 196 [2024-10-24 19:35:22,388 INFO L226 Difference]: Without dead ends: 195 [2024-10-24 19:35:22,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:22,388 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 8 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:22,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-24 19:35:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 160. [2024-10-24 19:35:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 142 states have (on average 1.380281690140845) internal successors, (196), 148 states have internal predecessors, (196), 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-10-24 19:35:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2024-10-24 19:35:22,395 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 20 [2024-10-24 19:35:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:22,395 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2024-10-24 19:35:22,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2024-10-24 19:35:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 19:35:22,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:22,397 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 19:35:22,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 19:35:22,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:22,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash 642925723, now seen corresponding path program 1 times [2024-10-24 19:35:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:22,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780010870] [2024-10-24 19:35:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 19:35:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 19:35:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:22,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780010870] [2024-10-24 19:35:22,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780010870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:22,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156051481] [2024-10-24 19:35:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:22,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:22,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:22,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:35:22,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 19:35:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:35:22,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 19:35:22,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156051481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:22,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:35:22,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-24 19:35:22,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910372928] [2024-10-24 19:35:22,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:22,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:35:22,671 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-24 19:35:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:22,719 INFO L93 Difference]: Finished difference Result 160 states and 209 transitions. [2024-10-24 19:35:22,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:35:22,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 37 [2024-10-24 19:35:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:22,721 INFO L225 Difference]: With dead ends: 160 [2024-10-24 19:35:22,721 INFO L226 Difference]: Without dead ends: 159 [2024-10-24 19:35:22,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 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-10-24 19:35:22,721 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:22,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-24 19:35:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-10-24 19:35:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 147 states have internal predecessors, (195), 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-10-24 19:35:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 208 transitions. [2024-10-24 19:35:22,730 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 208 transitions. Word has length 37 [2024-10-24 19:35:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:22,730 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 208 transitions. [2024-10-24 19:35:22,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-24 19:35:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2024-10-24 19:35:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 19:35:22,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:22,732 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:22,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 19:35:22,932 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-10-24 19:35:22,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:22,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1544138856, now seen corresponding path program 1 times [2024-10-24 19:35:22,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:22,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580760435] [2024-10-24 19:35:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:22,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 19:35:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 19:35:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:23,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:23,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580760435] [2024-10-24 19:35:23,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580760435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:23,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274580639] [2024-10-24 19:35:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:23,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:23,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:23,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:35:23,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 19:35:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 19:35:23,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:23,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:35:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274580639] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:35:23,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:35:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-24 19:35:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804230539] [2024-10-24 19:35:23,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:35:23,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 19:35:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 19:35:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-24 19:35:23,350 INFO L87 Difference]: Start difference. First operand 159 states and 208 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 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-10-24 19:35:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:23,480 INFO L93 Difference]: Finished difference Result 228 states and 295 transitions. [2024-10-24 19:35:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 19:35:23,481 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 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 38 [2024-10-24 19:35:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:23,482 INFO L225 Difference]: With dead ends: 228 [2024-10-24 19:35:23,482 INFO L226 Difference]: Without dead ends: 177 [2024-10-24 19:35:23,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 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-10-24 19:35:23,486 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:23,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1186 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-24 19:35:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2024-10-24 19:35:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 155 states have internal predecessors, (203), 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-10-24 19:35:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2024-10-24 19:35:23,499 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 38 [2024-10-24 19:35:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:23,500 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2024-10-24 19:35:23,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 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-10-24 19:35:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2024-10-24 19:35:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 19:35:23,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:23,501 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 19:35:23,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 19:35:23,702 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-10-24 19:35:23,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:23,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:23,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1239305742, now seen corresponding path program 1 times [2024-10-24 19:35:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:23,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441958575] [2024-10-24 19:35:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:23,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 19:35:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 19:35:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 19:35:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:23,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:23,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441958575] [2024-10-24 19:35:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441958575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:23,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:23,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 19:35:23,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861647516] [2024-10-24 19:35:23,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:23,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 19:35:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:23,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 19:35:23,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 19:35:23,915 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-10-24 19:35:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:24,047 INFO L93 Difference]: Finished difference Result 274 states and 351 transitions. [2024-10-24 19:35:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 19:35:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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 45 [2024-10-24 19:35:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:24,053 INFO L225 Difference]: With dead ends: 274 [2024-10-24 19:35:24,053 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 19:35:24,053 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-10-24 19:35:24,054 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 105 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:24,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 793 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 19:35:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2024-10-24 19:35:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.345945945945946) internal successors, (249), 191 states have internal predecessors, (249), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (15), 13 states have call predecessors, (15), 12 states have call successors, (15) [2024-10-24 19:35:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 278 transitions. [2024-10-24 19:35:24,070 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 278 transitions. Word has length 45 [2024-10-24 19:35:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:24,071 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 278 transitions. [2024-10-24 19:35:24,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-10-24 19:35:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 278 transitions. [2024-10-24 19:35:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 19:35:24,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:24,072 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 19:35:24,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 19:35:24,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:24,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1394115849, now seen corresponding path program 1 times [2024-10-24 19:35:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197720385] [2024-10-24 19:35:24,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:35:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 19:35:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:24,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:24,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197720385] [2024-10-24 19:35:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197720385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:24,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:24,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 19:35:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377167307] [2024-10-24 19:35:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:24,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 19:35:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:24,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 19:35:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 19:35:24,287 INFO L87 Difference]: Start difference. First operand 212 states and 278 transitions. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-10-24 19:35:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:24,383 INFO L93 Difference]: Finished difference Result 310 states and 401 transitions. [2024-10-24 19:35:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:35:24,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 42 [2024-10-24 19:35:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:24,385 INFO L225 Difference]: With dead ends: 310 [2024-10-24 19:35:24,385 INFO L226 Difference]: Without dead ends: 224 [2024-10-24 19:35:24,387 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-10-24 19:35:24,387 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:24,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 698 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-24 19:35:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 215. [2024-10-24 19:35:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 188 states have (on average 1.3404255319148937) internal successors, (252), 194 states have internal predecessors, (252), 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-10-24 19:35:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2024-10-24 19:35:24,410 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 42 [2024-10-24 19:35:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:24,410 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2024-10-24 19:35:24,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-10-24 19:35:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2024-10-24 19:35:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 19:35:24,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:24,415 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 19:35:24,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 19:35:24,415 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:24,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:24,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1333300146, now seen corresponding path program 1 times [2024-10-24 19:35:24,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:24,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694404131] [2024-10-24 19:35:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:24,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 19:35:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 19:35:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 19:35:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:24,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694404131] [2024-10-24 19:35:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694404131] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922399247] [2024-10-24 19:35:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:24,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:24,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:35:24,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 19:35:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:24,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 19:35:24,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:24,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:35:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:24,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922399247] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:35:24,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:35:24,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-24 19:35:24,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008989931] [2024-10-24 19:35:24,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:35:24,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 19:35:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:24,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 19:35:24,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-24 19:35:24,922 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 19:35:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:25,021 INFO L93 Difference]: Finished difference Result 309 states and 398 transitions. [2024-10-24 19:35:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:35:25,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 45 [2024-10-24 19:35:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:25,026 INFO L225 Difference]: With dead ends: 309 [2024-10-24 19:35:25,026 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 19:35:25,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-24 19:35:25,027 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:25,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1131 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 19:35:25,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-10-24 19:35:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.3370165745856353) internal successors, (242), 186 states have internal predecessors, (242), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-24 19:35:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 263 transitions. [2024-10-24 19:35:25,049 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 263 transitions. Word has length 45 [2024-10-24 19:35:25,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:25,049 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 263 transitions. [2024-10-24 19:35:25,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-24 19:35:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 263 transitions. [2024-10-24 19:35:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 19:35:25,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:25,050 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:25,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 19:35:25,251 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-10-24 19:35:25,251 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:25,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:25,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2144389050, now seen corresponding path program 2 times [2024-10-24 19:35:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:25,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614442327] [2024-10-24 19:35:25,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:25,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:35:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 19:35:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 19:35:25,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614442327] [2024-10-24 19:35:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614442327] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63634711] [2024-10-24 19:35:25,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:35:25,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:25,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:25,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:35:25,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 19:35:25,535 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 19:35:25,535 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:35:25,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:35:25,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:25,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:25,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63634711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:25,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:35:25,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-24 19:35:25,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5905830] [2024-10-24 19:35:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:25,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 19:35:25,694 INFO L87 Difference]: Start difference. First operand 204 states and 263 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-10-24 19:35:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:25,748 INFO L93 Difference]: Finished difference Result 204 states and 263 transitions. [2024-10-24 19:35:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:35:25,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 46 [2024-10-24 19:35:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:25,750 INFO L225 Difference]: With dead ends: 204 [2024-10-24 19:35:25,750 INFO L226 Difference]: Without dead ends: 203 [2024-10-24 19:35:25,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 19:35:25,751 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:25,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 267 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-24 19:35:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-10-24 19:35:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 181 states have (on average 1.3259668508287292) internal successors, (240), 185 states have internal predecessors, (240), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-24 19:35:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 261 transitions. [2024-10-24 19:35:25,759 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 261 transitions. Word has length 46 [2024-10-24 19:35:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:25,759 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 261 transitions. [2024-10-24 19:35:25,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-10-24 19:35:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 261 transitions. [2024-10-24 19:35:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 19:35:25,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:25,760 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:25,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 19:35:25,961 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-10-24 19:35:25,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:25,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1152669905, now seen corresponding path program 1 times [2024-10-24 19:35:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:25,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645875591] [2024-10-24 19:35:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:35:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 19:35:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:26,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:26,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645875591] [2024-10-24 19:35:26,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645875591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:26,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:26,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:35:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076889236] [2024-10-24 19:35:26,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:26,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:26,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:26,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:26,029 INFO L87 Difference]: Start difference. First operand 203 states and 261 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-24 19:35:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:26,065 INFO L93 Difference]: Finished difference Result 205 states and 263 transitions. [2024-10-24 19:35:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:26,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 54 [2024-10-24 19:35:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:26,067 INFO L225 Difference]: With dead ends: 205 [2024-10-24 19:35:26,067 INFO L226 Difference]: Without dead ends: 203 [2024-10-24 19:35:26,067 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-10-24 19:35:26,067 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 21 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:26,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 147 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-24 19:35:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2024-10-24 19:35:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 181 states have (on average 1.3038674033149171) internal successors, (236), 183 states have internal predecessors, (236), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-24 19:35:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 257 transitions. [2024-10-24 19:35:26,075 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 257 transitions. Word has length 54 [2024-10-24 19:35:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:26,075 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 257 transitions. [2024-10-24 19:35:26,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-24 19:35:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 257 transitions. [2024-10-24 19:35:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 19:35:26,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:26,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:26,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 19:35:26,077 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:26,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1373028941, now seen corresponding path program 1 times [2024-10-24 19:35:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:26,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120293167] [2024-10-24 19:35:26,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:35:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 19:35:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:26,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120293167] [2024-10-24 19:35:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120293167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:26,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 19:35:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719482035] [2024-10-24 19:35:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:26,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 19:35:26,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 19:35:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 19:35:26,258 INFO L87 Difference]: Start difference. First operand 201 states and 257 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-10-24 19:35:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:26,431 INFO L93 Difference]: Finished difference Result 326 states and 420 transitions. [2024-10-24 19:35:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:35:26,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 55 [2024-10-24 19:35:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:26,433 INFO L225 Difference]: With dead ends: 326 [2024-10-24 19:35:26,433 INFO L226 Difference]: Without dead ends: 270 [2024-10-24 19:35:26,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 19:35:26,433 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 32 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:26,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 645 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-24 19:35:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 227. [2024-10-24 19:35:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 205 states have (on average 1.2878048780487805) internal successors, (264), 207 states have internal predecessors, (264), 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-10-24 19:35:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 289 transitions. [2024-10-24 19:35:26,442 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 289 transitions. Word has length 55 [2024-10-24 19:35:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:26,443 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 289 transitions. [2024-10-24 19:35:26,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-10-24 19:35:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 289 transitions. [2024-10-24 19:35:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 19:35:26,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:26,444 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:26,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 19:35:26,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 863957708, now seen corresponding path program 1 times [2024-10-24 19:35:26,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696011803] [2024-10-24 19:35:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:35:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 19:35:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696011803] [2024-10-24 19:35:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696011803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:26,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:26,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:26,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66976983] [2024-10-24 19:35:26,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:26,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:26,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:26,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:26,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:26,522 INFO L87 Difference]: Start difference. First operand 227 states and 289 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 19:35:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:26,534 INFO L93 Difference]: Finished difference Result 297 states and 379 transitions. [2024-10-24 19:35:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2024-10-24 19:35:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:26,536 INFO L225 Difference]: With dead ends: 297 [2024-10-24 19:35:26,536 INFO L226 Difference]: Without dead ends: 229 [2024-10-24 19:35:26,536 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-10-24 19:35:26,537 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:26,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-24 19:35:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-24 19:35:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 207 states have (on average 1.285024154589372) internal successors, (266), 209 states have internal predecessors, (266), 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-10-24 19:35:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 291 transitions. [2024-10-24 19:35:26,545 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 291 transitions. Word has length 56 [2024-10-24 19:35:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:26,546 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 291 transitions. [2024-10-24 19:35:26,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 19:35:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 291 transitions. [2024-10-24 19:35:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 19:35:26,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:26,547 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:26,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 19:35:26,547 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:26,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash -335132819, now seen corresponding path program 1 times [2024-10-24 19:35:26,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025157839] [2024-10-24 19:35:26,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:35:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 19:35:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025157839] [2024-10-24 19:35:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025157839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:26,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:35:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190485569] [2024-10-24 19:35:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:26,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:26,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:26,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:26,629 INFO L87 Difference]: Start difference. First operand 229 states and 291 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-10-24 19:35:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:26,663 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2024-10-24 19:35:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:26,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 56 [2024-10-24 19:35:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:26,665 INFO L225 Difference]: With dead ends: 240 [2024-10-24 19:35:26,665 INFO L226 Difference]: Without dead ends: 233 [2024-10-24 19:35:26,665 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-10-24 19:35:26,666 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:26,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 154 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:26,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-24 19:35:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 218. [2024-10-24 19:35:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 198 states have internal predecessors, (250), 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-10-24 19:35:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 275 transitions. [2024-10-24 19:35:26,677 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 275 transitions. Word has length 56 [2024-10-24 19:35:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:26,677 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 275 transitions. [2024-10-24 19:35:26,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-10-24 19:35:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 275 transitions. [2024-10-24 19:35:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 19:35:26,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:26,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:26,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 19:35:26,679 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:26,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash 248584285, now seen corresponding path program 1 times [2024-10-24 19:35:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:26,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944763382] [2024-10-24 19:35:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:35:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 19:35:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 19:35:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 19:35:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944763382] [2024-10-24 19:35:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944763382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075163624] [2024-10-24 19:35:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:26,937 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:35:26,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 19:35:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:27,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 19:35:27,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:27,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075163624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:27,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:35:27,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 13 [2024-10-24 19:35:27,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065435843] [2024-10-24 19:35:27,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:27,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 19:35:27,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 19:35:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 19:35:27,122 INFO L87 Difference]: Start difference. First operand 218 states and 275 transitions. Second operand has 11 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-24 19:35:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:27,281 INFO L93 Difference]: Finished difference Result 362 states and 462 transitions. [2024-10-24 19:35:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:35:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 71 [2024-10-24 19:35:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:27,283 INFO L225 Difference]: With dead ends: 362 [2024-10-24 19:35:27,283 INFO L226 Difference]: Without dead ends: 297 [2024-10-24 19:35:27,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 19:35:27,284 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 58 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:27,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1005 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-24 19:35:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 227. [2024-10-24 19:35:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 202 states have (on average 1.2673267326732673) internal successors, (256), 205 states have internal predecessors, (256), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-24 19:35:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 288 transitions. [2024-10-24 19:35:27,304 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 288 transitions. Word has length 71 [2024-10-24 19:35:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:27,304 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 288 transitions. [2024-10-24 19:35:27,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-24 19:35:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 288 transitions. [2024-10-24 19:35:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 19:35:27,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:27,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:27,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 19:35:27,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:27,508 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:27,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:27,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1498957305, now seen corresponding path program 1 times [2024-10-24 19:35:27,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:27,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423956825] [2024-10-24 19:35:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:27,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:27,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:27,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:35:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:27,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 19:35:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:27,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 19:35:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:27,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423956825] [2024-10-24 19:35:27,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423956825] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:27,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329351685] [2024-10-24 19:35:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:27,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:27,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:27,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:35:27,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 19:35:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:27,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 19:35:27,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:28,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329351685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:35:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 12 [2024-10-24 19:35:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662512995] [2024-10-24 19:35:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:35:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:28,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:35:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:35:28,043 INFO L87 Difference]: Start difference. First operand 227 states and 288 transitions. Second operand has 10 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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-10-24 19:35:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:28,205 INFO L93 Difference]: Finished difference Result 368 states and 466 transitions. [2024-10-24 19:35:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 19:35:28,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 64 [2024-10-24 19:35:28,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:28,207 INFO L225 Difference]: With dead ends: 368 [2024-10-24 19:35:28,207 INFO L226 Difference]: Without dead ends: 300 [2024-10-24 19:35:28,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 19:35:28,209 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 61 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:28,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 693 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-24 19:35:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 291. [2024-10-24 19:35:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 258 states have (on average 1.2596899224806202) internal successors, (325), 262 states have internal predecessors, (325), 21 states have call successors, (21), 8 states have call predecessors, (21), 11 states have return successors, (24), 20 states have call predecessors, (24), 18 states have call successors, (24) [2024-10-24 19:35:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 370 transitions. [2024-10-24 19:35:28,228 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 370 transitions. Word has length 64 [2024-10-24 19:35:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:28,229 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 370 transitions. [2024-10-24 19:35:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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-10-24 19:35:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 370 transitions. [2024-10-24 19:35:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 19:35:28,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:28,231 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:28,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 19:35:28,431 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-10-24 19:35:28,432 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 19:35:28,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1952004489, now seen corresponding path program 1 times [2024-10-24 19:35:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685022063] [2024-10-24 19:35:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:28,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:28,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 19:35:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 19:35:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 19:35:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 19:35:28,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:28,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685022063] [2024-10-24 19:35:28,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685022063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:28,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 19:35:28,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067947127] [2024-10-24 19:35:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:28,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 19:35:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 19:35:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 19:35:28,723 INFO L87 Difference]: Start difference. First operand 291 states and 370 transitions. Second operand has 11 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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-10-24 19:35:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:28,926 INFO L93 Difference]: Finished difference Result 443 states and 567 transitions. [2024-10-24 19:35:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 19:35:28,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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 64 [2024-10-24 19:35:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:28,927 INFO L225 Difference]: With dead ends: 443 [2024-10-24 19:35:28,927 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 19:35:28,928 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-10-24 19:35:28,929 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 111 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:28,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 760 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 19:35:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 19:35:28,929 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-10-24 19:35:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 19:35:28,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-10-24 19:35:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:28,930 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 19:35:28,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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-10-24 19:35:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 19:35:28,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 19:35:28,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-10-24 19:35:28,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-10-24 19:35:28,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-10-24 19:35:28,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-10-24 19:35:28,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-10-24 19:35:28,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-10-24 19:35:28,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-10-24 19:35:28,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-10-24 19:35:28,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-10-24 19:35:28,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-10-24 19:35:28,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-10-24 19:35:28,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-10-24 19:35:28,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-10-24 19:35:28,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-10-24 19:35:28,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-10-24 19:35:28,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-10-24 19:35:28,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 19:35:28,937 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] [2024-10-24 19:35:28,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 19:35:29,481 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:35:29,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:35:29 BoogieIcfgContainer [2024-10-24 19:35:29,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:35:29,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:35:29,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:35:29,504 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:35:29,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:19" (3/4) ... [2024-10-24 19:35:29,506 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 19:35:29,509 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-10-24 19:35:29,510 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2024-10-24 19:35:29,510 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-24 19:35:29,518 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2024-10-24 19:35:29,518 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 19:35:29,518 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 19:35:29,518 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 19:35:29,544 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) [2024-10-24 19:35:29,544 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2024-10-24 19:35:29,567 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) [2024-10-24 19:35:29,567 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2024-10-24 19:35:29,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 19:35:29,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 19:35:29,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:35:29,611 INFO L158 Benchmark]: Toolchain (without parser) took 11618.44ms. Allocated memory was 138.4MB in the beginning and 352.3MB in the end (delta: 213.9MB). Free memory was 67.8MB in the beginning and 146.5MB in the end (delta: -78.7MB). Peak memory consumption was 136.6MB. Max. memory is 16.1GB. [2024-10-24 19:35:29,611 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory was 102.4MB in the beginning and 102.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:35:29,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.40ms. Allocated memory was 138.4MB in the beginning and 230.7MB in the end (delta: 92.3MB). Free memory was 67.6MB in the beginning and 198.3MB in the end (delta: -130.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-10-24 19:35:29,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.41ms. Allocated memory is still 230.7MB. Free memory was 198.2MB in the beginning and 200.0MB in the end (delta: -1.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-24 19:35:29,611 INFO L158 Benchmark]: Boogie Preprocessor took 66.52ms. Allocated memory is still 230.7MB. Free memory was 200.0MB in the beginning and 197.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:35:29,612 INFO L158 Benchmark]: RCFGBuilder took 717.18ms. Allocated memory is still 230.7MB. Free memory was 197.9MB in the beginning and 172.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 19:35:29,612 INFO L158 Benchmark]: TraceAbstraction took 10336.88ms. Allocated memory was 230.7MB in the beginning and 352.3MB in the end (delta: 121.6MB). Free memory was 172.8MB in the beginning and 152.8MB in the end (delta: 19.9MB). Peak memory consumption was 181.4MB. Max. memory is 16.1GB. [2024-10-24 19:35:29,612 INFO L158 Benchmark]: Witness Printer took 106.75ms. Allocated memory is still 352.3MB. Free memory was 152.8MB in the beginning and 146.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 19:35:29,613 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory was 102.4MB in the beginning and 102.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.40ms. Allocated memory was 138.4MB in the beginning and 230.7MB in the end (delta: 92.3MB). Free memory was 67.6MB in the beginning and 198.3MB in the end (delta: -130.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.41ms. Allocated memory is still 230.7MB. Free memory was 198.2MB in the beginning and 200.0MB in the end (delta: -1.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.52ms. Allocated memory is still 230.7MB. Free memory was 200.0MB in the beginning and 197.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 717.18ms. Allocated memory is still 230.7MB. Free memory was 197.9MB in the beginning and 172.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10336.88ms. Allocated memory was 230.7MB in the beginning and 352.3MB in the end (delta: 121.6MB). Free memory was 172.8MB in the beginning and 152.8MB in the end (delta: 19.9MB). Peak memory consumption was 181.4MB. Max. memory is 16.1GB. * Witness Printer took 106.75ms. Allocated memory is still 352.3MB. Free memory was 152.8MB in the beginning and 146.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 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: 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 - 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: 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 998 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 965 mSDsluCounter, 10982 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8646 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1956 IncrementalHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 2336 mSDtfsCounter, 1956 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 536 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=22, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 326 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1147 NumberOfCodeBlocks, 1131 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1198 ConstructedInterpolants, 0 QuantifiedInterpolants, 2176 SizeOfPredicates, 6 NumberOfNonLiveVariables, 962 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 32 InterpolantComputations, 21 PerfectInterpolantSequences, 340/362 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]: Loop Invariant Derived loop invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) - 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-10-24 19:35:29,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE