/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-32.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 14:36:48,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 14:36:49,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 14:36:49,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 14:36:49,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 14:36:49,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 14:36:49,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 14:36:49,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 14:36:49,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 14:36:49,062 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 14:36:49,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 14:36:49,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 14:36:49,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 14:36:49,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 14:36:49,065 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 14:36:49,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 14:36:49,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 14:36:49,066 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 14:36:49,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 14:36:49,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 14:36:49,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 14:36:49,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 14:36:49,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 14:36:49,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 14:36:49,071 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 14:36:49,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 14:36:49,072 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 14:36:49,072 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 14:36:49,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 14:36:49,072 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 14:36:49,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 14:36:49,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 14:36:49,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 14:36:49,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 14:36:49,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:36:49,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 14:36:49,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 14:36:49,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 14:36:49,075 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 14:36:49,075 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 14:36:49,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 14:36:49,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 14:36:49,078 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 14:36:49,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 14:36:49,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 14:36:49,079 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 14:36:49,079 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 14:36:49,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 14:36:49,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 14:36:49,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 14:36:49,325 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 14:36:49,325 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 14:36:49,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2023-12-16 14:36:50,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 14:36:50,684 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 14:36:50,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2023-12-16 14:36:50,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df79bfe7d/944b9cf10a4e41aaa9d4f50460effbbf/FLAGcbe5c0593 [2023-12-16 14:36:50,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df79bfe7d/944b9cf10a4e41aaa9d4f50460effbbf [2023-12-16 14:36:50,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 14:36:50,712 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 14:36:50,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 14:36:50,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 14:36:50,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 14:36:50,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:50,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2eaf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50, skipping insertion in model container [2023-12-16 14:36:50,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:50,737 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 14:36:50,849 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-32.i[915,928] [2023-12-16 14:36:50,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:36:50,891 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 14:36:50,902 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-32.i[915,928] [2023-12-16 14:36:50,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:36:50,926 INFO L206 MainTranslator]: Completed translation [2023-12-16 14:36:50,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50 WrapperNode [2023-12-16 14:36:50,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 14:36:50,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 14:36:50,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 14:36:50,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 14:36:50,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:50,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:50,956 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 66 [2023-12-16 14:36:50,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 14:36:50,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 14:36:50,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 14:36:50,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 14:36:50,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:50,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:50,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:50,977 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]. [2023-12-16 14:36:50,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:50,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:50,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:51,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:51,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:51,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:51,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 14:36:51,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 14:36:51,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 14:36:51,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 14:36:51,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (1/1) ... [2023-12-16 14:36:51,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:36:51,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 14:36:51,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 14:36:51,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 14:36:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 14:36:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 14:36:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 14:36:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 14:36:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 14:36:51,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 14:36:51,120 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 14:36:51,127 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 14:36:51,317 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 14:36:51,396 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 14:36:51,396 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 14:36:51,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:36:51 BoogieIcfgContainer [2023-12-16 14:36:51,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 14:36:51,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 14:36:51,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 14:36:51,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 14:36:51,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:36:50" (1/3) ... [2023-12-16 14:36:51,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570fb6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:36:51, skipping insertion in model container [2023-12-16 14:36:51,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:50" (2/3) ... [2023-12-16 14:36:51,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570fb6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:36:51, skipping insertion in model container [2023-12-16 14:36:51,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:36:51" (3/3) ... [2023-12-16 14:36:51,404 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-32.i [2023-12-16 14:36:51,418 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 14:36:51,418 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 14:36:51,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 14:36:51,455 INFO L357 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, mHoare=true, 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;@3001362a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 14:36:51,455 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 14:36:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-16 14:36:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 14:36:51,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:51,466 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:51,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:51,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:51,471 INFO L85 PathProgramCache]: Analyzing trace with hash -927732406, now seen corresponding path program 1 times [2023-12-16 14:36:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:51,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30752231] [2023-12-16 14:36:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:51,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:51,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:51,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:51,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 14:36:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:51,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 14:36:51,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 14:36:51,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:36:51,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:36:51,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30752231] [2023-12-16 14:36:51,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30752231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:36:51,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:36:51,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 14:36:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38027719] [2023-12-16 14:36:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:36:51,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 14:36:51,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:36:51,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 14:36:51,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 14:36:51,712 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 14:36:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:36:51,740 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2023-12-16 14:36:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 14:36:51,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2023-12-16 14:36:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:36:51,748 INFO L225 Difference]: With dead ends: 47 [2023-12-16 14:36:51,748 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 14:36:51,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 14:36:51,754 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 14:36:51,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 14:36:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 14:36:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-16 14:36:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-16 14:36:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-12-16 14:36:51,788 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 45 [2023-12-16 14:36:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:36:51,788 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-12-16 14:36:51,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 14:36:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-12-16 14:36:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 14:36:51,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:51,791 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:51,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 14:36:51,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:51,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:51,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash 474599308, now seen corresponding path program 1 times [2023-12-16 14:36:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010268239] [2023-12-16 14:36:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:51,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:51,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:51,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:51,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 14:36:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:52,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 14:36:52,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 14:36:58,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:37:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 14:37:07,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:37:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010268239] [2023-12-16 14:37:07,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010268239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 14:37:07,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 14:37:07,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-16 14:37:07,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648624398] [2023-12-16 14:37:07,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 14:37:07,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 14:37:07,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:37:07,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 14:37:07,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-16 14:37:07,661 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 14:37:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:37:10,299 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2023-12-16 14:37:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 14:37:10,300 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2023-12-16 14:37:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:37:10,301 INFO L225 Difference]: With dead ends: 48 [2023-12-16 14:37:10,301 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 14:37:10,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2023-12-16 14:37:10,303 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 76 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 14:37:10,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 14:37:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 14:37:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2023-12-16 14:37:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 14:37:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2023-12-16 14:37:10,315 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 45 [2023-12-16 14:37:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:37:10,315 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2023-12-16 14:37:10,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 14:37:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2023-12-16 14:37:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 14:37:10,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:37:10,317 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:37:10,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 14:37:10,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:37:10,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:37:10,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:37:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash 474539726, now seen corresponding path program 1 times [2023-12-16 14:37:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:37:10,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766823215] [2023-12-16 14:37:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:37:10,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:37:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:37:10,525 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:37:10,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 14:37:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:37:10,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 14:37:10,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:37:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 14:37:18,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:37:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 14:37:21,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:37:21,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766823215] [2023-12-16 14:37:21,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766823215] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 14:37:21,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 14:37:21,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-16 14:37:21,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095274177] [2023-12-16 14:37:21,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 14:37:21,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 14:37:21,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:37:21,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 14:37:21,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-16 14:37:21,453 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 14:37:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:37:22,397 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-12-16 14:37:22,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 14:37:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2023-12-16 14:37:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:37:22,398 INFO L225 Difference]: With dead ends: 55 [2023-12-16 14:37:22,398 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 14:37:22,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2023-12-16 14:37:22,400 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 14:37:22,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 100 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 14:37:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 14:37:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 14:37:22,402 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) [2023-12-16 14:37:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 14:37:22,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2023-12-16 14:37:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:37:22,402 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 14:37:22,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 14:37:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 14:37:22,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 14:37:22,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 14:37:22,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 14:37:22,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:37:22,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 14:37:23,457 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 35 37) no Hoare annotation was computed. [2023-12-16 14:37:23,458 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 14:37:23,458 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 14:37:23,458 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-12-16 14:37:23,458 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 14:37:23,458 INFO L899 garLoopResultBuilder]: For program point L48-1(line 48) no Hoare annotation was computed. [2023-12-16 14:37:23,458 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 14:37:23,458 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_8~0 .cse0) (fp.geq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 (fp.neg .cse1)) (fp.geq ~var_1_8~0 (fp.neg .cse0))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:23,458 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_8~0 .cse0) (fp.geq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 (fp.neg .cse1)) (fp.geq ~var_1_8~0 (fp.neg .cse0))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:23,458 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 14:37:23,459 INFO L895 garLoopResultBuilder]: At program point L62-2(lines 62 68) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_8~0 .cse0) (fp.geq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 (fp.neg .cse1)) (fp.geq ~var_1_8~0 (fp.neg .cse0))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:23,459 INFO L899 garLoopResultBuilder]: For program point L62-3(lines 62 68) no Hoare annotation was computed. [2023-12-16 14:37:23,459 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_8~0 .cse0) (fp.geq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 (fp.neg .cse1)) (fp.geq ~var_1_8~0 (fp.neg .cse0))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:23,459 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_8~0 .cse0) (fp.geq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 (fp.neg .cse1)) (fp.geq ~var_1_8~0 (fp.neg .cse0))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:23,459 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-12-16 14:37:23,459 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_8~0 .cse0) (fp.geq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 (fp.neg .cse1)) (fp.geq ~var_1_8~0 (fp.neg .cse0))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:23,459 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 14:37:23,459 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_8~0 .cse0) (fp.geq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 (fp.neg .cse1)) (fp.geq ~var_1_8~0 (fp.neg .cse0))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:23,460 INFO L899 garLoopResultBuilder]: For program point L51(lines 40 52) no Hoare annotation was computed. [2023-12-16 14:37:23,460 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-12-16 14:37:23,460 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2023-12-16 14:37:23,460 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 14:37:23,460 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 14:37:23,460 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 14:37:23,460 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 14:37:23,463 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-16 14:37:23,465 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 14:37:23,477 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 14:37:23,478 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 14:37:23,478 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 14:37:23,478 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 14:37:23,478 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 14:37:23,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:37:23 BoogieIcfgContainer [2023-12-16 14:37:23,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 14:37:23,483 INFO L158 Benchmark]: Toolchain (without parser) took 32768.66ms. Allocated memory was 238.0MB in the beginning and 883.9MB in the end (delta: 645.9MB). Free memory was 190.5MB in the beginning and 730.9MB in the end (delta: -540.4MB). Peak memory consumption was 106.6MB. Max. memory is 8.0GB. [2023-12-16 14:37:23,483 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 188.7MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 14:37:23,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.33ms. Allocated memory is still 238.0MB. Free memory was 190.5MB in the beginning and 178.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 14:37:23,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.28ms. Allocated memory is still 238.0MB. Free memory was 178.4MB in the beginning and 176.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 14:37:23,485 INFO L158 Benchmark]: Boogie Preprocessor took 50.44ms. Allocated memory is still 238.0MB. Free memory was 176.8MB in the beginning and 174.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 14:37:23,485 INFO L158 Benchmark]: RCFGBuilder took 389.01ms. Allocated memory is still 238.0MB. Free memory was 174.2MB in the beginning and 158.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 14:37:23,485 INFO L158 Benchmark]: TraceAbstraction took 32081.61ms. Allocated memory was 238.0MB in the beginning and 883.9MB in the end (delta: 645.9MB). Free memory was 157.4MB in the beginning and 730.9MB in the end (delta: -573.4MB). Peak memory consumption was 73.0MB. Max. memory is 8.0GB. [2023-12-16 14:37:23,487 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 188.7MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.33ms. Allocated memory is still 238.0MB. Free memory was 190.5MB in the beginning and 178.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.28ms. Allocated memory is still 238.0MB. Free memory was 178.4MB in the beginning and 176.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.44ms. Allocated memory is still 238.0MB. Free memory was 176.8MB in the beginning and 174.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 389.01ms. Allocated memory is still 238.0MB. Free memory was 174.2MB in the beginning and 158.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 32081.61ms. Allocated memory was 238.0MB in the beginning and 883.9MB in the end (delta: 645.9MB). Free memory was 157.4MB in the beginning and 730.9MB in the end (delta: -573.4MB). Peak memory consumption was 73.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.0s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 75 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=2, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 28 PreInvPairs, 44 NumberOfFragments, 207 HoareAnnotationTreeSize, 28 FormulaSimplifications, 976 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FormulaSimplificationsInter, 1527 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 220 ConstructedInterpolants, 2 QuantifiedInterpolants, 4670 SizeOfPredicates, 34 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 328/420 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 1 specifications checked. All of them hold - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-16 14:37:23,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...