./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_5a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:11:02,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:11:02,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:11:02,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:11:02,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:11:02,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:11:02,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:11:02,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:11:02,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:11:02,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:11:02,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:11:02,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:11:02,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:11:02,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:11:02,650 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:11:02,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:11:02,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:11:02,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:11:02,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:11:02,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:11:02,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:11:02,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:11:02,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:11:02,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:11:02,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:11:02,656 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:11:02,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:11:02,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:11:02,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:11:02,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:11:02,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:11:02,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:11:02,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:11:02,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:11:02,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:11:02,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:11:02,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:11:02,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:11:02,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:11:02,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:11:02,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:11:02,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:11:02,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:11:02,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:11:02,663 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-clean/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-clean/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 -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2024-10-11 20:11:02,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:11:02,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:11:02,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:11:02,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:11:02,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:11:02,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2024-10-11 20:11:04,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:11:04,483 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:11:04,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2024-10-11 20:11:04,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7cd048ec5/630c178d176b481da73c724eeabc429c/FLAGacc15b23c [2024-10-11 20:11:04,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7cd048ec5/630c178d176b481da73c724eeabc429c [2024-10-11 20:11:04,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:11:04,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:11:04,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:11:04,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:11:04,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:11:04,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:11:04" (1/1) ... [2024-10-11 20:11:04,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55dfcbb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:04, skipping insertion in model container [2024-10-11 20:11:04,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:11:04" (1/1) ... [2024-10-11 20:11:04,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:11:05,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:11:05,164 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:11:05,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:11:05,227 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:11:05,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05 WrapperNode [2024-10-11 20:11:05,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:11:05,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:11:05,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:11:05,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:11:05,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,273 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 164 [2024-10-11 20:11:05,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:11:05,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:11:05,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:11:05,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:11:05,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,301 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-11 20:11:05,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:11:05,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:11:05,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:11:05,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:11:05,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (1/1) ... [2024-10-11 20:11:05,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:11:05,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:05,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:11:05,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:11:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:11:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:11:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-11 20:11:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-11 20:11:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:11:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:11:05,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:11:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:11:05,470 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:11:05,473 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:11:05,902 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-10-11 20:11:05,902 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:11:05,926 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:11:05,927 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:11:05,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:05 BoogieIcfgContainer [2024-10-11 20:11:05,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:11:05,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:11:05,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:11:05,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:11:05,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:11:04" (1/3) ... [2024-10-11 20:11:05,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7043c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:11:05, skipping insertion in model container [2024-10-11 20:11:05,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:05" (2/3) ... [2024-10-11 20:11:05,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7043c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:11:05, skipping insertion in model container [2024-10-11 20:11:05,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:05" (3/3) ... [2024-10-11 20:11:05,934 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2024-10-11 20:11:05,948 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:11:05,948 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-11 20:11:06,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:11:06,030 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;@366e7345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:11:06,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 20:11:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 76 states have (on average 1.6710526315789473) internal successors, (127), 93 states have internal predecessors, (127), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:11:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:11:06,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:06,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:06,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:06,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:06,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1391191870, now seen corresponding path program 1 times [2024-10-11 20:11:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077426126] [2024-10-11 20:11:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,251 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-11 20:11:06,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:06,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077426126] [2024-10-11 20:11:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077426126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:06,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:06,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:11:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147003079] [2024-10-11 20:11:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:06,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:11:06,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:06,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:11:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:11:06,290 INFO L87 Difference]: Start difference. First operand has 100 states, 76 states have (on average 1.6710526315789473) internal successors, (127), 93 states have internal predecessors, (127), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:06,452 INFO L93 Difference]: Finished difference Result 245 states and 358 transitions. [2024-10-11 20:11:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:11:06,456 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-11 20:11:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:06,466 INFO L225 Difference]: With dead ends: 245 [2024-10-11 20:11:06,467 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 20:11:06,472 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-11 20:11:06,478 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 82 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:06,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 320 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 20:11:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2024-10-11 20:11:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.469387755102041) internal successors, (144), 109 states have internal predecessors, (144), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2024-10-11 20:11:06,542 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 8 [2024-10-11 20:11:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:06,544 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2024-10-11 20:11:06,544 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-11 20:11:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2024-10-11 20:11:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:11:06,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:06,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:06,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:11:06,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:06,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:06,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1576534914, now seen corresponding path program 1 times [2024-10-11 20:11:06,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:06,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992345234] [2024-10-11 20:11:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:06,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,628 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-11 20:11:06,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:06,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992345234] [2024-10-11 20:11:06,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992345234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:06,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:11:06,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505899422] [2024-10-11 20:11:06,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:06,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:06,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:06,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:06,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:06,636 INFO L87 Difference]: Start difference. First operand 116 states and 152 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-11 20:11:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:06,720 INFO L93 Difference]: Finished difference Result 242 states and 324 transitions. [2024-10-11 20:11:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:06,721 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-11 20:11:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:06,723 INFO L225 Difference]: With dead ends: 242 [2024-10-11 20:11:06,723 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 20:11:06,724 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-11 20:11:06,726 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:06,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 153 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 20:11:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2024-10-11 20:11:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.4509803921568627) internal successors, (148), 113 states have internal predecessors, (148), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 156 transitions. [2024-10-11 20:11:06,752 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 156 transitions. Word has length 13 [2024-10-11 20:11:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:06,753 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 156 transitions. [2024-10-11 20:11:06,753 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-11 20:11:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 156 transitions. [2024-10-11 20:11:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:11:06,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:06,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:06,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:11:06,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1576646260, now seen corresponding path program 1 times [2024-10-11 20:11:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444254524] [2024-10-11 20:11:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:11:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444254524] [2024-10-11 20:11:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444254524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:06,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:11:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111780433] [2024-10-11 20:11:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:06,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:06,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:06,852 INFO L87 Difference]: Start difference. First operand 120 states and 156 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:06,894 INFO L93 Difference]: Finished difference Result 120 states and 156 transitions. [2024-10-11 20:11:06,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:06,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:11:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:06,897 INFO L225 Difference]: With dead ends: 120 [2024-10-11 20:11:06,897 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 20:11:06,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:06,898 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:06,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 152 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 20:11:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 20:11:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 112 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2024-10-11 20:11:06,914 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 13 [2024-10-11 20:11:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:06,915 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2024-10-11 20:11:06,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2024-10-11 20:11:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:11:06,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:06,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:06,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:11:06,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:06,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1048301616, now seen corresponding path program 1 times [2024-10-11 20:11:06,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:06,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960392915] [2024-10-11 20:11:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:07,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:07,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960392915] [2024-10-11 20:11:07,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960392915] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:07,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742775919] [2024-10-11 20:11:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:07,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:07,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:07,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:07,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:11:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:11:07,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:07,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742775919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:07,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 20:11:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070066363] [2024-10-11 20:11:07,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:07,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:11:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:11:07,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:07,160 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:07,231 INFO L93 Difference]: Finished difference Result 152 states and 204 transitions. [2024-10-11 20:11:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:11:07,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:11:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:07,233 INFO L225 Difference]: With dead ends: 152 [2024-10-11 20:11:07,233 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 20:11:07,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:07,234 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 28 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:07,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 165 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 20:11:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2024-10-11 20:11:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 119 states have internal predecessors, (153), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 161 transitions. [2024-10-11 20:11:07,246 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 161 transitions. Word has length 14 [2024-10-11 20:11:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:07,246 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-10-11 20:11:07,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 161 transitions. [2024-10-11 20:11:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:11:07,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:07,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:07,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:11:07,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:07,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:07,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1631393747, now seen corresponding path program 1 times [2024-10-11 20:11:07,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183705350] [2024-10-11 20:11:07,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:07,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:07,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:07,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183705350] [2024-10-11 20:11:07,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183705350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:07,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99923443] [2024-10-11 20:11:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:07,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:07,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:07,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:07,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:11:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:11:07,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:07,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99923443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:07,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:07,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 20:11:07,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562412251] [2024-10-11 20:11:07,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:07,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:07,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:07,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:07,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:07,594 INFO L87 Difference]: Start difference. First operand 126 states and 161 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:07,649 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2024-10-11 20:11:07,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:07,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:11:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:07,651 INFO L225 Difference]: With dead ends: 132 [2024-10-11 20:11:07,651 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 20:11:07,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:07,652 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:07,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 20:11:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2024-10-11 20:11:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 121 states have internal predecessors, (155), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 163 transitions. [2024-10-11 20:11:07,673 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 163 transitions. Word has length 14 [2024-10-11 20:11:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:07,673 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 163 transitions. [2024-10-11 20:11:07,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 163 transitions. [2024-10-11 20:11:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:11:07,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:07,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:07,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:11:07,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:07,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:07,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1862388179, now seen corresponding path program 1 times [2024-10-11 20:11:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:07,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698119843] [2024-10-11 20:11:07,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:11:07,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:07,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698119843] [2024-10-11 20:11:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698119843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:07,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:07,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:11:07,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686513003] [2024-10-11 20:11:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:07,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:07,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:07,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:07,909 INFO L87 Difference]: Start difference. First operand 128 states and 163 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:07,947 INFO L93 Difference]: Finished difference Result 128 states and 163 transitions. [2024-10-11 20:11:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:11:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:07,948 INFO L225 Difference]: With dead ends: 128 [2024-10-11 20:11:07,948 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 20:11:07,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:07,949 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:07,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 20:11:07,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-11 20:11:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.385321100917431) internal successors, (151), 118 states have internal predecessors, (151), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2024-10-11 20:11:07,969 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 159 transitions. Word has length 15 [2024-10-11 20:11:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:07,970 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 159 transitions. [2024-10-11 20:11:07,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2024-10-11 20:11:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:11:07,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:07,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:07,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:11:07,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:07,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:07,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1075102853, now seen corresponding path program 1 times [2024-10-11 20:11:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:07,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459806758] [2024-10-11 20:11:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:07,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,057 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-11 20:11:08,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:08,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459806758] [2024-10-11 20:11:08,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459806758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:08,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:08,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:08,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898135286] [2024-10-11 20:11:08,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:08,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:08,060 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:08,155 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2024-10-11 20:11:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:11:08,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:11:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:08,158 INFO L225 Difference]: With dead ends: 142 [2024-10-11 20:11:08,158 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 20:11:08,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:08,159 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 95 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:08,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 286 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 20:11:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2024-10-11 20:11:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 123 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2024-10-11 20:11:08,167 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 15 [2024-10-11 20:11:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:08,168 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2024-10-11 20:11:08,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2024-10-11 20:11:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:11:08,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:08,169 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:08,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:11:08,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:08,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1897295780, now seen corresponding path program 1 times [2024-10-11 20:11:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:08,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601030673] [2024-10-11 20:11:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,219 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-11 20:11:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:08,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601030673] [2024-10-11 20:11:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601030673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:08,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906751648] [2024-10-11 20:11:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:08,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:08,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:08,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:11:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:11:08,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:08,323 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-11 20:11:08,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:08,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906751648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:08,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:08,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 20:11:08,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132189178] [2024-10-11 20:11:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:08,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:11:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:08,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:11:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:08,325 INFO L87 Difference]: Start difference. First operand 130 states and 165 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-11 20:11:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:08,423 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2024-10-11 20:11:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:11:08,427 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-11 20:11:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:08,428 INFO L225 Difference]: With dead ends: 142 [2024-10-11 20:11:08,428 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 20:11:08,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:08,429 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:08,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 166 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 20:11:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2024-10-11 20:11:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.368421052631579) internal successors, (156), 123 states have internal predecessors, (156), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2024-10-11 20:11:08,441 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 16 [2024-10-11 20:11:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:08,442 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2024-10-11 20:11:08,442 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-11 20:11:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2024-10-11 20:11:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:11:08,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:08,446 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:08,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:11:08,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:08,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:08,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1960574653, now seen corresponding path program 1 times [2024-10-11 20:11:08,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915742919] [2024-10-11 20:11:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,705 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-11 20:11:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915742919] [2024-10-11 20:11:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915742919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240266938] [2024-10-11 20:11:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:08,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:08,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:08,708 INFO L87 Difference]: Start difference. First operand 130 states and 164 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-11 20:11:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:08,795 INFO L93 Difference]: Finished difference Result 194 states and 249 transitions. [2024-10-11 20:11:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:11:08,795 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-11 20:11:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:08,796 INFO L225 Difference]: With dead ends: 194 [2024-10-11 20:11:08,797 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 20:11:08,797 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-11 20:11:08,798 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 110 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:08,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 233 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 20:11:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 167. [2024-10-11 20:11:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 150 states have (on average 1.38) internal successors, (207), 159 states have internal predecessors, (207), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 215 transitions. [2024-10-11 20:11:08,807 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 215 transitions. Word has length 21 [2024-10-11 20:11:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:08,807 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 215 transitions. [2024-10-11 20:11:08,807 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-11 20:11:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 215 transitions. [2024-10-11 20:11:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:11:08,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:08,809 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:08,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:11:08,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:08,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1989202009, now seen corresponding path program 1 times [2024-10-11 20:11:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:08,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718061581] [2024-10-11 20:11:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,881 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-11 20:11:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718061581] [2024-10-11 20:11:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718061581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:08,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924608778] [2024-10-11 20:11:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:08,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:08,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:08,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:08,884 INFO L87 Difference]: Start difference. First operand 167 states and 215 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-11 20:11:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:08,973 INFO L93 Difference]: Finished difference Result 185 states and 238 transitions. [2024-10-11 20:11:08,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:11:08,973 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-11 20:11:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:08,975 INFO L225 Difference]: With dead ends: 185 [2024-10-11 20:11:08,975 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 20:11:08,975 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-11 20:11:08,976 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 111 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:08,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 233 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 20:11:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 158. [2024-10-11 20:11:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 141 states have (on average 1.375886524822695) internal successors, (194), 150 states have internal predecessors, (194), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2024-10-11 20:11:08,989 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 21 [2024-10-11 20:11:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:08,991 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2024-10-11 20:11:08,991 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-11 20:11:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2024-10-11 20:11:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:11:08,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:08,992 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:08,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:11:08,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:08,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash 201293720, now seen corresponding path program 1 times [2024-10-11 20:11:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:08,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207567236] [2024-10-11 20:11:08,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:11:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:11:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207567236] [2024-10-11 20:11:09,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207567236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:09,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:09,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:09,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738187662] [2024-10-11 20:11:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:09,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:09,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:09,067 INFO L87 Difference]: Start difference. First operand 158 states and 202 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:11:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:09,158 INFO L93 Difference]: Finished difference Result 174 states and 225 transitions. [2024-10-11 20:11:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:11:09,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-11 20:11:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:09,160 INFO L225 Difference]: With dead ends: 174 [2024-10-11 20:11:09,160 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 20:11:09,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:09,162 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 109 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:09,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 226 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 20:11:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 149. [2024-10-11 20:11:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 134 states have (on average 1.3656716417910448) internal successors, (183), 141 states have internal predecessors, (183), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 191 transitions. [2024-10-11 20:11:09,174 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 191 transitions. Word has length 27 [2024-10-11 20:11:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:09,174 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 191 transitions. [2024-10-11 20:11:09,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:11:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 191 transitions. [2024-10-11 20:11:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:11:09,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:09,175 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:09,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:11:09,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:09,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash 172666364, now seen corresponding path program 1 times [2024-10-11 20:11:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:09,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097650668] [2024-10-11 20:11:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:11:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:11:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097650668] [2024-10-11 20:11:09,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097650668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:09,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:09,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286238132] [2024-10-11 20:11:09,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:09,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:09,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:09,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:09,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:09,233 INFO L87 Difference]: Start difference. First operand 149 states and 191 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:11:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:09,314 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2024-10-11 20:11:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:11:09,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-11 20:11:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:09,315 INFO L225 Difference]: With dead ends: 165 [2024-10-11 20:11:09,316 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 20:11:09,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:09,316 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 110 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:09,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 224 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 20:11:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2024-10-11 20:11:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 125 states have (on average 1.36) internal successors, (170), 130 states have internal predecessors, (170), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 178 transitions. [2024-10-11 20:11:09,326 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 178 transitions. Word has length 27 [2024-10-11 20:11:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:09,326 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 178 transitions. [2024-10-11 20:11:09,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:11:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 178 transitions. [2024-10-11 20:11:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:11:09,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:09,327 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 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-11 20:11:09,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:11:09,328 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:09,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1205326593, now seen corresponding path program 1 times [2024-10-11 20:11:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:09,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88269006] [2024-10-11 20:11:09,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:11:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:11:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:11:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88269006] [2024-10-11 20:11:09,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88269006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:09,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468924253] [2024-10-11 20:11:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:09,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:09,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:09,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:09,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:11:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:11:09,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:11:09,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:09,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468924253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 20:11:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043657934] [2024-10-11 20:11:09,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:09,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:11:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:09,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:11:09,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:09,514 INFO L87 Difference]: Start difference. First operand 138 states and 178 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:09,592 INFO L93 Difference]: Finished difference Result 310 states and 397 transitions. [2024-10-11 20:11:09,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:11:09,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-11 20:11:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:09,594 INFO L225 Difference]: With dead ends: 310 [2024-10-11 20:11:09,594 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 20:11:09,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:09,595 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:09,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 189 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 20:11:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2024-10-11 20:11:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 128 states have (on average 1.3515625) internal successors, (173), 133 states have internal predecessors, (173), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 181 transitions. [2024-10-11 20:11:09,605 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 181 transitions. Word has length 38 [2024-10-11 20:11:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:09,605 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 181 transitions. [2024-10-11 20:11:09,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 181 transitions. [2024-10-11 20:11:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 20:11:09,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:09,617 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-11 20:11:09,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:11:09,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:11:09,818 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:09,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1624137461, now seen corresponding path program 1 times [2024-10-11 20:11:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:09,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952142622] [2024-10-11 20:11:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:11:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:11:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952142622] [2024-10-11 20:11:09,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952142622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201293168] [2024-10-11 20:11:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:09,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:09,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:09,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:09,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:11:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:10,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:11:10,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:11:10,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:11:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:11:10,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201293168] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:11:10,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:11:10,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:11:10,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675687162] [2024-10-11 20:11:10,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:11:10,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:11:10,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:10,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:11:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:11:10,181 INFO L87 Difference]: Start difference. First operand 142 states and 181 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:11:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:10,349 INFO L93 Difference]: Finished difference Result 440 states and 569 transitions. [2024-10-11 20:11:10,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:11:10,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2024-10-11 20:11:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:10,352 INFO L225 Difference]: With dead ends: 440 [2024-10-11 20:11:10,352 INFO L226 Difference]: Without dead ends: 341 [2024-10-11 20:11:10,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:11:10,353 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 154 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:10,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 265 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-11 20:11:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 157. [2024-10-11 20:11:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 148 states have internal predecessors, (191), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 199 transitions. [2024-10-11 20:11:10,367 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 199 transitions. Word has length 46 [2024-10-11 20:11:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:10,368 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 199 transitions. [2024-10-11 20:11:10,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:11:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 199 transitions. [2024-10-11 20:11:10,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 20:11:10,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:10,369 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:10,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:11:10,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:11:10,570 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:10,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2088195001, now seen corresponding path program 1 times [2024-10-11 20:11:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:10,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066892649] [2024-10-11 20:11:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:10,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:11:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 20:11:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:11:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066892649] [2024-10-11 20:11:10,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066892649] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587419882] [2024-10-11 20:11:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:10,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:10,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:10,664 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:10,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:11:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:10,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:11:10,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:11:10,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:11:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:11:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587419882] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:11:10,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:11:10,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:11:10,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724199142] [2024-10-11 20:11:10,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:11:10,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:11:10,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:10,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:11:10,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:11:10,867 INFO L87 Difference]: Start difference. First operand 157 states and 199 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:11:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:11,045 INFO L93 Difference]: Finished difference Result 453 states and 594 transitions. [2024-10-11 20:11:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:11:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2024-10-11 20:11:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:11,047 INFO L225 Difference]: With dead ends: 453 [2024-10-11 20:11:11,047 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 20:11:11,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:11:11,048 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 139 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:11,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 281 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 20:11:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 172. [2024-10-11 20:11:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 158 states have (on average 1.3227848101265822) internal successors, (209), 163 states have internal predecessors, (209), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2024-10-11 20:11:11,078 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 47 [2024-10-11 20:11:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:11,078 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2024-10-11 20:11:11,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:11:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2024-10-11 20:11:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 20:11:11,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:11,079 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:11,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:11:11,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:11:11,280 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:11,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1706147695, now seen corresponding path program 1 times [2024-10-11 20:11:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112794177] [2024-10-11 20:11:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:11:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:11:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:11:11,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:11,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112794177] [2024-10-11 20:11:11,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112794177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:11,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278343412] [2024-10-11 20:11:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:11,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:11,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:11,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:11,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:11:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:11:11,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 20:11:11,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:11,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278343412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:11,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:11,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-10-11 20:11:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815985421] [2024-10-11 20:11:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:11,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:11,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:11,432 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:11,479 INFO L93 Difference]: Finished difference Result 295 states and 374 transitions. [2024-10-11 20:11:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-10-11 20:11:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:11,481 INFO L225 Difference]: With dead ends: 295 [2024-10-11 20:11:11,481 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 20:11:11,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:11,482 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 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-11 20:11:11,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 20:11:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2024-10-11 20:11:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 168 states have internal predecessors, (213), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2024-10-11 20:11:11,495 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 48 [2024-10-11 20:11:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:11,495 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2024-10-11 20:11:11,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2024-10-11 20:11:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 20:11:11,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:11,496 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:11,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:11:11,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:11,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:11,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:11,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1354951588, now seen corresponding path program 1 times [2024-10-11 20:11:11,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:11,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098152386] [2024-10-11 20:11:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:11,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:11:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 20:11:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:11:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098152386] [2024-10-11 20:11:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098152386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910160997] [2024-10-11 20:11:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:11,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:11,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:11,830 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:11,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:11:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:11,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 20:11:11,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:11:11,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:11:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:11:12,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910160997] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:11:12,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:11:12,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2024-10-11 20:11:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553489652] [2024-10-11 20:11:12,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:11:12,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:11:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:12,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:11:12,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:11:12,105 INFO L87 Difference]: Start difference. First operand 177 states and 221 transitions. Second operand has 16 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 20:11:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:12,413 INFO L93 Difference]: Finished difference Result 352 states and 441 transitions. [2024-10-11 20:11:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 20:11:12,414 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 49 [2024-10-11 20:11:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:12,415 INFO L225 Difference]: With dead ends: 352 [2024-10-11 20:11:12,415 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 20:11:12,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:11:12,417 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 34 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:12,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 681 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:11:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 20:11:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2024-10-11 20:11:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.3) internal successors, (169), 135 states have internal predecessors, (169), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 177 transitions. [2024-10-11 20:11:12,447 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 177 transitions. Word has length 49 [2024-10-11 20:11:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:12,448 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 177 transitions. [2024-10-11 20:11:12,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 20:11:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2024-10-11 20:11:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 20:11:12,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:12,449 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:12,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:11:12,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:11:12,651 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:12,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1354940610, now seen corresponding path program 1 times [2024-10-11 20:11:12,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:12,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669318273] [2024-10-11 20:11:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:12,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:12,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:12,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:11:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:12,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:11:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:11:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669318273] [2024-10-11 20:11:12,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669318273] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448155697] [2024-10-11 20:11:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:12,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:12,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:12,806 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:12,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:11:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:12,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:11:12,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 20:11:12,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448155697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-11 20:11:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12221668] [2024-10-11 20:11:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:12,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:12,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:12,931 INFO L87 Difference]: Start difference. First operand 144 states and 177 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:12,981 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2024-10-11 20:11:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:12,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-10-11 20:11:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:12,983 INFO L225 Difference]: With dead ends: 266 [2024-10-11 20:11:12,983 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 20:11:12,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:12,984 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 146 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-11 20:11:12,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 146 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 20:11:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2024-10-11 20:11:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 126 states have (on average 1.2857142857142858) internal successors, (162), 131 states have internal predecessors, (162), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2024-10-11 20:11:12,998 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 55 [2024-10-11 20:11:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:12,998 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2024-10-11 20:11:12,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2024-10-11 20:11:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 20:11:12,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:12,999 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:13,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:11:13,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:11:13,204 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:13,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash -572232841, now seen corresponding path program 1 times [2024-10-11 20:11:13,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:13,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210472114] [2024-10-11 20:11:13,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:11:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:11:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210472114] [2024-10-11 20:11:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210472114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:13,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 20:11:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001285465] [2024-10-11 20:11:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:11:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:11:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:13,442 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:13,515 INFO L93 Difference]: Finished difference Result 183 states and 218 transitions. [2024-10-11 20:11:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:11:13,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2024-10-11 20:11:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:13,517 INFO L225 Difference]: With dead ends: 183 [2024-10-11 20:11:13,517 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 20:11:13,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:13,518 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:13,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 451 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 20:11:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2024-10-11 20:11:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 131 states have internal predecessors, (160), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:11:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2024-10-11 20:11:13,532 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 56 [2024-10-11 20:11:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:13,533 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2024-10-11 20:11:13,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2024-10-11 20:11:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 20:11:13,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:13,535 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2024-10-11 20:11:13,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:11:13,535 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:13,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:13,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1631311384, now seen corresponding path program 2 times [2024-10-11 20:11:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:13,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946397704] [2024-10-11 20:11:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:11:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:11:13,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:13,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946397704] [2024-10-11 20:11:13,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946397704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:13,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104462402] [2024-10-11 20:11:13,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:11:13,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:13,701 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:13,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:11:13,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:11:13,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:11:13,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 20:11:13,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:11:13,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:13,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104462402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:13,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:13,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-10-11 20:11:13,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976193945] [2024-10-11 20:11:13,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:13,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:11:13,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:11:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:11:13,806 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:13,854 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2024-10-11 20:11:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:11:13,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2024-10-11 20:11:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:13,855 INFO L225 Difference]: With dead ends: 180 [2024-10-11 20:11:13,855 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 20:11:13,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:11:13,856 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:13,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 379 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 20:11:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2024-10-11 20:11:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 134 states have internal predecessors, (163), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 20:11:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 172 transitions. [2024-10-11 20:11:13,870 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 172 transitions. Word has length 60 [2024-10-11 20:11:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:13,871 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 172 transitions. [2024-10-11 20:11:13,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2024-10-11 20:11:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 20:11:13,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:13,872 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:13,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:11:14,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:14,076 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:14,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1722988846, now seen corresponding path program 1 times [2024-10-11 20:11:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:14,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793851676] [2024-10-11 20:11:14,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:14,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:14,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:14,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:11:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:11:14,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:14,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793851676] [2024-10-11 20:11:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793851676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:14,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:14,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 20:11:14,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296852947] [2024-10-11 20:11:14,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:14,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:11:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:11:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:11:14,618 INFO L87 Difference]: Start difference. First operand 144 states and 172 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:14,794 INFO L93 Difference]: Finished difference Result 166 states and 199 transitions. [2024-10-11 20:11:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:11:14,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2024-10-11 20:11:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:14,796 INFO L225 Difference]: With dead ends: 166 [2024-10-11 20:11:14,796 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 20:11:14,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:11:14,797 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:14,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 568 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 20:11:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-10-11 20:11:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 152 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 20:11:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2024-10-11 20:11:14,814 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 62 [2024-10-11 20:11:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:14,815 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2024-10-11 20:11:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2024-10-11 20:11:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 20:11:14,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:14,816 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:14,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 20:11:14,817 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:14,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1021924268, now seen corresponding path program 1 times [2024-10-11 20:11:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968534902] [2024-10-11 20:11:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:15,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:11:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:11:15,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968534902] [2024-10-11 20:11:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968534902] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819342122] [2024-10-11 20:11:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:15,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:15,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:15,372 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:15,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:11:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:15,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 20:11:15,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:11:15,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819342122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 15 [2024-10-11 20:11:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171126561] [2024-10-11 20:11:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:15,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:11:15,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:15,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:11:15,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:11:15,524 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:15,625 INFO L93 Difference]: Finished difference Result 209 states and 248 transitions. [2024-10-11 20:11:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:11:15,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2024-10-11 20:11:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:15,627 INFO L225 Difference]: With dead ends: 209 [2024-10-11 20:11:15,627 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 20:11:15,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:11:15,628 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:15,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 568 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 20:11:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2024-10-11 20:11:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 160 states have internal predecessors, (194), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 20:11:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2024-10-11 20:11:15,645 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 62 [2024-10-11 20:11:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:15,646 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2024-10-11 20:11:15,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2024-10-11 20:11:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 20:11:15,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:15,648 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:15,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 20:11:15,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 20:11:15,849 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:15,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1873046877, now seen corresponding path program 1 times [2024-10-11 20:11:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021293321] [2024-10-11 20:11:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:11:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:11:16,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:16,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021293321] [2024-10-11 20:11:16,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021293321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:16,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:16,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:11:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334385116] [2024-10-11 20:11:16,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:16,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:11:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:11:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:11:16,252 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:16,351 INFO L93 Difference]: Finished difference Result 172 states and 207 transitions. [2024-10-11 20:11:16,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:11:16,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2024-10-11 20:11:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:16,353 INFO L225 Difference]: With dead ends: 172 [2024-10-11 20:11:16,353 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 20:11:16,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:11:16,353 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 33 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:16,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 436 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 20:11:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-10-11 20:11:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 154 states have (on average 1.2402597402597402) internal successors, (191), 157 states have internal predecessors, (191), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 20:11:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 204 transitions. [2024-10-11 20:11:16,368 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 204 transitions. Word has length 63 [2024-10-11 20:11:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:16,368 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 204 transitions. [2024-10-11 20:11:16,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 204 transitions. [2024-10-11 20:11:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 20:11:16,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:16,370 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 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-11 20:11:16,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 20:11:16,370 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:16,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2065088752, now seen corresponding path program 1 times [2024-10-11 20:11:16,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:16,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482218682] [2024-10-11 20:11:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:16,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:11:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 20:11:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482218682] [2024-10-11 20:11:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482218682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:16,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:11:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644304016] [2024-10-11 20:11:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:11:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:11:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:11:16,439 INFO L87 Difference]: Start difference. First operand 169 states and 204 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:16,483 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2024-10-11 20:11:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:11:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-10-11 20:11:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:16,485 INFO L225 Difference]: With dead ends: 169 [2024-10-11 20:11:16,485 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 20:11:16,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:16,487 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 18 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:16,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 186 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 20:11:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-11 20:11:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 149 states have (on average 1.2348993288590604) internal successors, (184), 150 states have internal predecessors, (184), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 20:11:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2024-10-11 20:11:16,501 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 64 [2024-10-11 20:11:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:16,501 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2024-10-11 20:11:16,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2024-10-11 20:11:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 20:11:16,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:16,502 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:16,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 20:11:16,503 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:16,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash 406758335, now seen corresponding path program 1 times [2024-10-11 20:11:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:16,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102400112] [2024-10-11 20:11:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:16,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:11:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:11:16,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:16,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102400112] [2024-10-11 20:11:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102400112] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:16,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607436827] [2024-10-11 20:11:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:16,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:16,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:16,635 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:16,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 20:11:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:16,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 20:11:16,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:11:16,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:16,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607436827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:16,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:16,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-10-11 20:11:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24071055] [2024-10-11 20:11:16,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:16,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:11:16,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:16,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:11:16,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:11:16,837 INFO L87 Difference]: Start difference. First operand 162 states and 197 transitions. Second operand has 10 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:16,957 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2024-10-11 20:11:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:11:16,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 65 [2024-10-11 20:11:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:16,962 INFO L225 Difference]: With dead ends: 185 [2024-10-11 20:11:16,962 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 20:11:16,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:11:16,963 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:16,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 414 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 20:11:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2024-10-11 20:11:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 159 states have (on average 1.2264150943396226) internal successors, (195), 160 states have internal predecessors, (195), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 20:11:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2024-10-11 20:11:16,978 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 65 [2024-10-11 20:11:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:16,978 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2024-10-11 20:11:16,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2024-10-11 20:11:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 20:11:16,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:16,979 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:16,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 20:11:17,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 20:11:17,183 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:17,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash 757518492, now seen corresponding path program 1 times [2024-10-11 20:11:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194191547] [2024-10-11 20:11:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:17,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:17,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:17,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:11:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:11:17,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:17,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194191547] [2024-10-11 20:11:17,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194191547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:17,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520206441] [2024-10-11 20:11:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:17,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:17,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:17,322 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:17,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 20:11:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:17,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 20:11:17,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:11:17,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520206441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:17,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:17,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-10-11 20:11:17,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962225137] [2024-10-11 20:11:17,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:17,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:11:17,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:17,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:11:17,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:11:17,539 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:17,656 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2024-10-11 20:11:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:11:17,657 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2024-10-11 20:11:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:17,658 INFO L225 Difference]: With dead ends: 189 [2024-10-11 20:11:17,658 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 20:11:17,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:11:17,659 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:17,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 529 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 20:11:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2024-10-11 20:11:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 159 states have (on average 1.220125786163522) internal successors, (194), 160 states have internal predecessors, (194), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 20:11:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2024-10-11 20:11:17,673 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 67 [2024-10-11 20:11:17,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:17,673 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2024-10-11 20:11:17,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2024-10-11 20:11:17,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 20:11:17,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:17,674 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-11 20:11:17,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 20:11:17,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:17,879 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -908362682, now seen corresponding path program 1 times [2024-10-11 20:11:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019829143] [2024-10-11 20:11:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:11:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:11:18,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019829143] [2024-10-11 20:11:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019829143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362595043] [2024-10-11 20:11:18,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:18,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:18,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:18,013 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:18,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 20:11:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:11:18,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 20:11:18,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:11:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 20:11:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362595043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:11:18,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:11:18,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2024-10-11 20:11:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854923318] [2024-10-11 20:11:18,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:11:18,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:11:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:11:18,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:11:18,258 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 20:11:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:18,461 INFO L93 Difference]: Finished difference Result 371 states and 445 transitions. [2024-10-11 20:11:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:11:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 67 [2024-10-11 20:11:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:18,463 INFO L225 Difference]: With dead ends: 371 [2024-10-11 20:11:18,463 INFO L226 Difference]: Without dead ends: 232 [2024-10-11 20:11:18,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:11:18,464 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 62 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:18,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 387 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-11 20:11:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 172. [2024-10-11 20:11:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 159 states have (on average 1.2075471698113207) internal successors, (192), 160 states have internal predecessors, (192), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 20:11:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2024-10-11 20:11:18,483 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 67 [2024-10-11 20:11:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:18,483 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2024-10-11 20:11:18,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 20:11:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2024-10-11 20:11:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 20:11:18,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:18,484 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2024-10-11 20:11:18,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 20:11:18,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 20:11:18,685 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:18,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash -634155779, now seen corresponding path program 1 times [2024-10-11 20:11:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:18,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153765089] [2024-10-11 20:11:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:11:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:11:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:11:18,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:18,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153765089] [2024-10-11 20:11:18,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153765089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:18,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364300871] [2024-10-11 20:11:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:18,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:18,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:18,882 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:18,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 20:11:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:18,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 20:11:18,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 20:11:19,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:19,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364300871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:19,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 16 [2024-10-11 20:11:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752130893] [2024-10-11 20:11:19,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:19,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:11:19,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:11:19,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:11:19,161 INFO L87 Difference]: Start difference. First operand 172 states and 205 transitions. Second operand has 12 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:19,307 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2024-10-11 20:11:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:11:19,308 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2024-10-11 20:11:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:19,309 INFO L225 Difference]: With dead ends: 185 [2024-10-11 20:11:19,309 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 20:11:19,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:11:19,310 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:19,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 594 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 20:11:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2024-10-11 20:11:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 143 states have (on average 1.2237762237762237) internal successors, (175), 145 states have internal predecessors, (175), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 20:11:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 187 transitions. [2024-10-11 20:11:19,338 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 187 transitions. Word has length 74 [2024-10-11 20:11:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:19,338 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 187 transitions. [2024-10-11 20:11:19,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 187 transitions. [2024-10-11 20:11:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 20:11:19,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:19,339 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:19,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 20:11:19,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 20:11:19,544 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:19,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1936067472, now seen corresponding path program 1 times [2024-10-11 20:11:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:19,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258733908] [2024-10-11 20:11:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:19,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:19,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:11:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:19,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:11:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 20:11:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258733908] [2024-10-11 20:11:19,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258733908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:19,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250156189] [2024-10-11 20:11:19,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:19,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:19,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:19,829 INFO L87 Difference]: Start difference. First operand 156 states and 187 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:19,867 INFO L93 Difference]: Finished difference Result 156 states and 187 transitions. [2024-10-11 20:11:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:11:19,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2024-10-11 20:11:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:19,869 INFO L225 Difference]: With dead ends: 156 [2024-10-11 20:11:19,869 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 20:11:19,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:19,870 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 15 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:19,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 227 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 20:11:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2024-10-11 20:11:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 125 states have internal predecessors, (150), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 20:11:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 162 transitions. [2024-10-11 20:11:19,882 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 162 transitions. Word has length 74 [2024-10-11 20:11:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:19,883 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 162 transitions. [2024-10-11 20:11:19,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 162 transitions. [2024-10-11 20:11:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 20:11:19,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:19,885 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:19,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 20:11:19,886 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:19,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash -270038723, now seen corresponding path program 1 times [2024-10-11 20:11:19,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:19,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032706256] [2024-10-11 20:11:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:19,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:11:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:11:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 20:11:20,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:20,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032706256] [2024-10-11 20:11:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032706256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:20,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:11:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977594419] [2024-10-11 20:11:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:20,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:11:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:20,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:11:20,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:20,309 INFO L87 Difference]: Start difference. First operand 135 states and 162 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:20,352 INFO L93 Difference]: Finished difference Result 135 states and 162 transitions. [2024-10-11 20:11:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:11:20,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2024-10-11 20:11:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:20,353 INFO L225 Difference]: With dead ends: 135 [2024-10-11 20:11:20,353 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:11:20,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:20,354 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 23 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:20,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 176 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:11:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:11:20,355 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-11 20:11:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:11:20,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2024-10-11 20:11:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:20,355 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:11:20,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:11:20,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:11:20,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-10-11 20:11:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-10-11 20:11:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-10-11 20:11:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-10-11 20:11:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-10-11 20:11:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-10-11 20:11:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-10-11 20:11:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-10-11 20:11:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-10-11 20:11:20,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-10-11 20:11:20,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-10-11 20:11:20,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-10-11 20:11:20,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-10-11 20:11:20,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-10-11 20:11:20,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-10-11 20:11:20,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-10-11 20:11:20,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 20:11:20,364 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:20,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:11:39,434 WARN L286 SmtUtils]: Spent 16.67s on a formula simplification. DAG size of input: 86 DAG size of output: 105 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-11 20:11:48,517 WARN L286 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 81 DAG size of output: 91 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-11 20:12:07,068 WARN L286 SmtUtils]: Spent 15.00s on a formula simplification. DAG size of input: 86 DAG size of output: 105 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-11 20:12:10,563 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:12:10,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:12:10 BoogieIcfgContainer [2024-10-11 20:12:10,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:12:10,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:12:10,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:12:10,594 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:12:10,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:05" (3/4) ... [2024-10-11 20:12:10,596 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:12:10,599 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-10-11 20:12:10,599 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:12:10,608 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-11 20:12:10,609 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 20:12:10,609 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:12:10,609 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:12:10,636 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (e <= \old(e))) && ((((m == \old(m)) && (e == 0)) || (\old(e) != 0)) || ((((((m % 2) == 0) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (0 <= (2147483649 + e))))) && (m <= 33554431)) [2024-10-11 20:12:10,636 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) [2024-10-11 20:12:10,667 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) [2024-10-11 20:12:10,668 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (e <= \old(e))) && ((((m == \old(m)) && (e == 0)) || (\old(e) != 0)) || ((((((m % 2) == 0) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (0 <= (2147483649 + e))))) && (m <= 33554431)) [2024-10-11 20:12:10,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:12:10,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:12:10,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:12:10,718 INFO L158 Benchmark]: Toolchain (without parser) took 65830.91ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 104.0MB in the beginning and 632.1MB in the end (delta: -528.1MB). Peak memory consumption was 319.0MB. Max. memory is 16.1GB. [2024-10-11 20:12:10,718 INFO L158 Benchmark]: CDTParser took 1.69ms. Allocated memory is still 159.4MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:12:10,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.52ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 89.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:12:10,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.71ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 86.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:12:10,719 INFO L158 Benchmark]: Boogie Preprocessor took 52.17ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:12:10,719 INFO L158 Benchmark]: RCFGBuilder took 600.56ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 84.4MB in the beginning and 196.7MB in the end (delta: -112.4MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-10-11 20:12:10,719 INFO L158 Benchmark]: TraceAbstraction took 64663.69ms. Allocated memory was 230.7MB in the beginning and 1.0GB in the end (delta: 773.8MB). Free memory was 196.7MB in the beginning and 638.4MB in the end (delta: -441.6MB). Peak memory consumption was 601.7MB. Max. memory is 16.1GB. [2024-10-11 20:12:10,719 INFO L158 Benchmark]: Witness Printer took 124.57ms. Allocated memory is still 1.0GB. Free memory was 638.4MB in the beginning and 632.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:12:10,720 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.69ms. Allocated memory is still 159.4MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.52ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 89.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.71ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 86.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.17ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 600.56ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 84.4MB in the beginning and 196.7MB in the end (delta: -112.4MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * TraceAbstraction took 64663.69ms. Allocated memory was 230.7MB in the beginning and 1.0GB in the end (delta: 773.8MB). Free memory was 196.7MB in the beginning and 638.4MB in the end (delta: -441.6MB). Peak memory consumption was 601.7MB. Max. memory is 16.1GB. * Witness Printer took 124.57ms. Allocated memory is still 1.0GB. Free memory was 638.4MB in the beginning and 632.1MB 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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: 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 3 procedures, 100 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 30, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1274 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1260 mSDsluCounter, 9077 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6884 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2703 IncrementalHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 2193 mSDtfsCounter, 2703 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1256 GetRequests, 1057 SyntacticMatches, 2 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=16, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 756 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2000 NumberOfCodeBlocks, 1964 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2160 ConstructedInterpolants, 0 QuantifiedInterpolants, 4418 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2074 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 49 InterpolantComputations, 26 PerfectInterpolantSequences, 939/1077 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: 37]: Loop Invariant Derived loop invariant: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (e <= \old(e))) && ((((m == \old(m)) && (e == 0)) || (\old(e) != 0)) || ((((((m % 2) == 0) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (0 <= (2147483649 + e))))) && (m <= 33554431)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) - ProcedureContractResult [Line: 24]: 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))) && (((\result == 0) || (0 < m)) || (e != 0))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:12:10,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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