/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_fillercode_fillercodestructure_filler-pe-ci_file-71.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 07:42:37,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 07:42:37,859 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-23 07:42:37,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 07:42:37,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 07:42:37,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 07:42:37,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 07:42:37,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 07:42:37,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 07:42:37,876 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 07:42:37,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 07:42:37,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 07:42:37,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 07:42:37,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 07:42:37,877 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 07:42:37,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 07:42:37,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 07:42:37,878 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 07:42:37,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 07:42:37,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 07:42:37,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 07:42:37,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 07:42:37,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 07:42:37,880 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 07:42:37,880 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 07:42:37,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 07:42:37,880 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 07:42:37,881 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 07:42:37,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 07:42:37,881 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 07:42:37,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 07:42:37,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 07:42:37,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 07:42:37,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 07:42:37,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 07:42:37,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 07:42:37,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 07:42:37,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 07:42:37,883 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 07:42:37,884 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 07:42:37,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 07:42:37,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 07:42:37,892 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 07:42:37,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 07:42:37,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 07:42:37,892 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 07:42:37,892 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-23 07:42:38,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 07:42:38,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 07:42:38,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 07:42:38,104 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 07:42:38,104 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 07:42:38,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-71.i [2023-12-23 07:42:39,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 07:42:39,386 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 07:42:39,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-71.i [2023-12-23 07:42:39,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8500df2b9/6a6dd27485f443a6a3d22639f6bc79ce/FLAG82fc4cf56 [2023-12-23 07:42:39,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8500df2b9/6a6dd27485f443a6a3d22639f6bc79ce [2023-12-23 07:42:39,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 07:42:39,407 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 07:42:39,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 07:42:39,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 07:42:39,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 07:42:39,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6996a7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39, skipping insertion in model container [2023-12-23 07:42:39,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,446 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 07:42:39,575 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_fillercode_fillercodestructure_filler-pe-ci_file-71.i[919,932] [2023-12-23 07:42:39,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 07:42:39,674 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 07:42:39,684 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_fillercode_fillercodestructure_filler-pe-ci_file-71.i[919,932] [2023-12-23 07:42:39,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 07:42:39,738 INFO L206 MainTranslator]: Completed translation [2023-12-23 07:42:39,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39 WrapperNode [2023-12-23 07:42:39,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 07:42:39,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 07:42:39,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 07:42:39,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 07:42:39,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,797 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2023-12-23 07:42:39,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 07:42:39,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 07:42:39,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 07:42:39,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 07:42:39,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,839 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-23 07:42:39,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 07:42:39,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 07:42:39,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 07:42:39,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 07:42:39,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (1/1) ... [2023-12-23 07:42:39,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 07:42:39,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 07:42:39,898 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-23 07:42:39,947 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-23 07:42:39,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 07:42:39,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 07:42:39,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 07:42:39,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 07:42:39,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 07:42:39,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 07:42:40,046 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 07:42:40,048 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 07:42:50,659 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 07:42:50,715 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 07:42:50,715 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 07:42:50,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:42:50 BoogieIcfgContainer [2023-12-23 07:42:50,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 07:42:50,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 07:42:50,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 07:42:50,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 07:42:50,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 07:42:39" (1/3) ... [2023-12-23 07:42:50,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b8bda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:42:50, skipping insertion in model container [2023-12-23 07:42:50,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:42:39" (2/3) ... [2023-12-23 07:42:50,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b8bda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:42:50, skipping insertion in model container [2023-12-23 07:42:50,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:42:50" (3/3) ... [2023-12-23 07:42:50,721 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-71.i [2023-12-23 07:42:50,737 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 07:42:50,737 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 07:42:50,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 07:42:50,780 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;@4b9fb4b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 07:42:50,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 07:42:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-23 07:42:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-23 07:42:50,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 07:42:50,800 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 07:42:50,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 07:42:50,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 07:42:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash -673638647, now seen corresponding path program 1 times [2023-12-23 07:42:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 07:42:50,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432025905] [2023-12-23 07:42:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 07:42:50,818 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-23 07:42:50,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 07:42:50,825 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-23 07:42:50,828 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-23 07:42:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 07:42:51,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 07:42:51,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 07:42:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1126 proven. 0 refuted. 0 times theorem prover too weak. 1394 trivial. 0 not checked. [2023-12-23 07:42:51,433 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 07:42:51,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 07:42:51,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432025905] [2023-12-23 07:42:51,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432025905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 07:42:51,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 07:42:51,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 07:42:51,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160935151] [2023-12-23 07:42:51,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 07:42:51,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 07:42:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 07:42:51,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 07:42:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 07:42:51,461 INFO L87 Difference]: Start difference. First operand has 91 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-23 07:42:55,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:42:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 07:42:55,733 INFO L93 Difference]: Finished difference Result 179 states and 328 transitions. [2023-12-23 07:42:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 07:42:55,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 220 [2023-12-23 07:42:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 07:42:55,834 INFO L225 Difference]: With dead ends: 179 [2023-12-23 07:42:55,835 INFO L226 Difference]: Without dead ends: 89 [2023-12-23 07:42:55,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 219 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-23 07:42:55,840 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-23 07:42:55,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-23 07:42:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-23 07:42:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-23 07:42:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-23 07:42:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 142 transitions. [2023-12-23 07:42:55,876 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 142 transitions. Word has length 220 [2023-12-23 07:42:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 07:42:55,877 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 142 transitions. [2023-12-23 07:42:55,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-23 07:42:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2023-12-23 07:42:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-23 07:42:55,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 07:42:55,881 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 07:42:55,896 INFO L552 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)] Ended with exit code 0 [2023-12-23 07:42:56,096 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-23 07:42:56,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 07:42:56,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 07:42:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1433348923, now seen corresponding path program 1 times [2023-12-23 07:42:56,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 07:42:56,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403321349] [2023-12-23 07:42:56,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 07:42:56,098 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-23 07:42:56,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 07:42:56,100 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-23 07:42:56,103 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-23 07:42:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 07:42:56,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 07:42:56,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 07:42:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-23 07:42:56,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 07:42:56,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 07:42:56,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403321349] [2023-12-23 07:42:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403321349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 07:42:56,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 07:42:56,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 07:42:56,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867857052] [2023-12-23 07:42:56,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 07:42:56,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 07:42:56,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 07:42:56,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 07:42:56,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 07:42:56,781 INFO L87 Difference]: Start difference. First operand 89 states and 142 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-23 07:43:01,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:05,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:09,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 07:43:09,274 INFO L93 Difference]: Finished difference Result 208 states and 329 transitions. [2023-12-23 07:43:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 07:43:09,280 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), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 220 [2023-12-23 07:43:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 07:43:09,282 INFO L225 Difference]: With dead ends: 208 [2023-12-23 07:43:09,282 INFO L226 Difference]: Without dead ends: 120 [2023-12-23 07:43:09,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 07:43:09,284 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 33 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-12-23 07:43:09,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 261 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2023-12-23 07:43:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-23 07:43:09,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2023-12-23 07:43:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-23 07:43:09,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 182 transitions. [2023-12-23 07:43:09,328 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 182 transitions. Word has length 220 [2023-12-23 07:43:09,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 07:43:09,329 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 182 transitions. [2023-12-23 07:43:09,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-23 07:43:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 182 transitions. [2023-12-23 07:43:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-23 07:43:09,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 07:43:09,332 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 07:43:09,349 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-23 07:43:09,549 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-23 07:43:09,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 07:43:09,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 07:43:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1974335049, now seen corresponding path program 1 times [2023-12-23 07:43:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 07:43:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392712300] [2023-12-23 07:43:09,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 07:43:09,552 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-23 07:43:09,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 07:43:09,556 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-23 07:43:09,558 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-23 07:43:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 07:43:10,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-23 07:43:10,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 07:43:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 743 proven. 87 refuted. 0 times theorem prover too weak. 1690 trivial. 0 not checked. [2023-12-23 07:43:12,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 07:43:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 18 proven. 87 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2023-12-23 07:43:13,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 07:43:13,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392712300] [2023-12-23 07:43:13,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392712300] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 07:43:13,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 07:43:13,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-12-23 07:43:13,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432456047] [2023-12-23 07:43:13,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 07:43:13,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-23 07:43:13,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 07:43:13,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-23 07:43:13,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-23 07:43:13,013 INFO L87 Difference]: Start difference. First operand 117 states and 182 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2023-12-23 07:43:19,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:23,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:27,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:29,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:33,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 07:43:34,610 INFO L93 Difference]: Finished difference Result 367 states and 552 transitions. [2023-12-23 07:43:34,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-23 07:43:34,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 220 [2023-12-23 07:43:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 07:43:34,615 INFO L225 Difference]: With dead ends: 367 [2023-12-23 07:43:34,615 INFO L226 Difference]: Without dead ends: 251 [2023-12-23 07:43:34,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 430 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2023-12-23 07:43:34,617 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 246 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2023-12-23 07:43:34,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 396 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 559 Invalid, 2 Unknown, 0 Unchecked, 21.1s Time] [2023-12-23 07:43:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-23 07:43:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 180. [2023-12-23 07:43:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 128 states have (on average 1.4140625) internal successors, (181), 131 states have internal predecessors, (181), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-23 07:43:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2023-12-23 07:43:34,643 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 220 [2023-12-23 07:43:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 07:43:34,643 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2023-12-23 07:43:34,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2023-12-23 07:43:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2023-12-23 07:43:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-23 07:43:34,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 07:43:34,646 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 07:43:34,679 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-23 07:43:34,847 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-23 07:43:34,848 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 07:43:34,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 07:43:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash -875563703, now seen corresponding path program 1 times [2023-12-23 07:43:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 07:43:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353769957] [2023-12-23 07:43:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 07:43:34,853 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-23 07:43:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 07:43:34,854 INFO L229 MonitoredProcess]: Starting monitored process 5 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-23 07:43:34,879 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 (5)] Waiting until timeout for monitored process [2023-12-23 07:43:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 07:43:35,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 07:43:35,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 07:43:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-23 07:43:35,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 07:43:35,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 07:43:35,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353769957] [2023-12-23 07:43:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353769957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 07:43:35,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 07:43:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 07:43:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207115497] [2023-12-23 07:43:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 07:43:35,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 07:43:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 07:43:35,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 07:43:35,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 07:43:35,415 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-23 07:43:39,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:43,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:47,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 07:43:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 07:43:47,285 INFO L93 Difference]: Finished difference Result 377 states and 564 transitions. [2023-12-23 07:43:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 07:43:47,291 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), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 220 [2023-12-23 07:43:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 07:43:47,293 INFO L225 Difference]: With dead ends: 377 [2023-12-23 07:43:47,293 INFO L226 Difference]: Without dead ends: 198 [2023-12-23 07:43:47,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 07:43:47,295 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 39 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-12-23 07:43:47,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 289 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2023-12-23 07:43:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-23 07:43:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2023-12-23 07:43:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 121 states have internal predecessors, (164), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-23 07:43:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2023-12-23 07:43:47,348 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 220 [2023-12-23 07:43:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 07:43:47,348 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2023-12-23 07:43:47,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-23 07:43:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2023-12-23 07:43:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-23 07:43:47,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 07:43:47,350 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 07:43:47,373 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 (5)] Forceful destruction successful, exit code 0 [2023-12-23 07:43:47,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-23 07:43:47,574 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 07:43:47,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 07:43:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash -818305401, now seen corresponding path program 1 times [2023-12-23 07:43:47,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 07:43:47,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812350057] [2023-12-23 07:43:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 07:43:47,575 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-23 07:43:47,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 07:43:47,577 INFO L229 MonitoredProcess]: Starting monitored process 6 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-23 07:43:47,578 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 (6)] Waiting until timeout for monitored process [2023-12-23 07:43:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 07:43:48,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-23 07:43:48,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 07:44:13,091 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:44:19,499 WARN L293 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:44:27,014 WARN L293 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:44:32,153 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:45:00,048 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:45:05,080 WARN L293 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:45:11,412 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:45:18,611 WARN L293 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:45:27,626 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:45:37,588 WARN L293 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:45:44,322 WARN L293 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:45:54,426 WARN L293 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:46:01,945 WARN L293 SmtUtils]: Spent 7.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:46:07,699 WARN L293 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:46:11,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (= c_~last_1_var_1_20~0 (_ bv10 16)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (not (= (_ bv0 8) c_~var_1_2~0)) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= (_ bv16 16) c_~last_1_var_1_21~0) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-23 07:46:15,903 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (= c_~last_1_var_1_20~0 (_ bv10 16)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (not (= (_ bv0 8) c_~var_1_2~0)) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= (_ bv16 16) c_~last_1_var_1_21~0) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-12-23 07:46:29,102 WARN L293 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:47:07,148 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:47:34,753 WARN L293 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:47:44,187 WARN L293 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:48:00,619 WARN L293 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:48:05,827 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:48:17,551 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:48:23,064 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:48:29,084 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:48:40,598 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (= c_~last_1_var_1_20~0 (_ bv10 16)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= (_ bv16 16) c_~last_1_var_1_21~0) (= c_~var_1_23~0 c_~var_1_22~0) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-23 07:48:44,692 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (= c_~last_1_var_1_20~0 (_ bv10 16)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= (_ bv16 16) c_~last_1_var_1_21~0) (= c_~var_1_23~0 c_~var_1_22~0) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-12-23 07:48:50,245 WARN L293 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:49:00,940 WARN L293 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:49:06,872 WARN L293 SmtUtils]: Spent 5.93s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:49:16,620 WARN L293 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:49:24,924 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:49:55,764 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:50:07,326 WARN L293 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:50:13,006 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:50:19,074 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:50:25,512 WARN L293 SmtUtils]: Spent 6.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:50:32,600 WARN L293 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:50:38,162 WARN L293 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:50:46,298 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:50:57,114 WARN L293 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:51:02,416 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:51:09,718 WARN L293 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:51:21,852 WARN L293 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:51:29,820 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (= c_~last_1_var_1_20~0 (_ bv10 16)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_~var_1_19~0 .cse0) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= (_ bv16 16) c_~last_1_var_1_21~0) (= c_~var_1_23~0 c_~var_1_22~0) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-23 07:51:33,916 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (= c_~last_1_var_1_20~0 (_ bv10 16)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_~var_1_19~0 .cse0) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= (_ bv16 16) c_~last_1_var_1_21~0) (= c_~var_1_23~0 c_~var_1_22~0) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-12-23 07:51:39,476 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:51:44,545 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:51:57,189 WARN L293 SmtUtils]: Spent 7.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:52:02,251 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:52:19,762 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:52:25,331 WARN L293 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:52:31,608 WARN L293 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:52:47,786 WARN L293 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:52:57,064 WARN L293 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:53:09,693 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:53:26,058 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:53:39,310 WARN L293 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:53:45,617 WARN L293 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:54:00,369 WARN L293 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:54:08,692 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:54:24,098 WARN L293 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:54:30,016 WARN L293 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:54:40,932 WARN L293 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:54:49,268 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:54:57,594 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:55:07,864 WARN L293 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:55:15,213 WARN L293 SmtUtils]: Spent 7.35s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:55:25,495 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:55:44,349 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:55:50,402 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:55:58,738 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:56:05,594 WARN L293 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:56:12,936 WARN L293 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:56:27,986 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:56:43,810 WARN L293 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:57:04,755 WARN L293 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 07:57:18,352 WARN L293 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-23 07:57:25,030 WARN L340 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 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 07:57:25,033 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 07:57:25,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 07:57:25,797 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 (6)] Forceful destruction successful, exit code 0 [2023-12-23 07:57:25,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-23 07:57:25,985 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 221 with TraceHistMax 36,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-17-2-2-2-1 context. [2023-12-23 07:57:25,989 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-23 07:57:25,990 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 07:57:25,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 07:57:25 BoogieIcfgContainer [2023-12-23 07:57:25,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 07:57:25,992 INFO L158 Benchmark]: Toolchain (without parser) took 886585.16ms. Allocated memory is still 309.3MB. Free memory was 258.2MB in the beginning and 229.2MB in the end (delta: 28.9MB). Peak memory consumption was 163.0MB. Max. memory is 8.0GB. [2023-12-23 07:57:25,992 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 07:57:25,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.86ms. Allocated memory is still 309.3MB. Free memory was 258.2MB in the beginning and 240.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-23 07:57:25,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.26ms. Allocated memory is still 309.3MB. Free memory was 240.3MB in the beginning and 237.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 07:57:25,993 INFO L158 Benchmark]: Boogie Preprocessor took 56.43ms. Allocated memory is still 309.3MB. Free memory was 237.6MB in the beginning and 233.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-23 07:57:25,993 INFO L158 Benchmark]: RCFGBuilder took 10859.78ms. Allocated memory is still 309.3MB. Free memory was 233.4MB in the beginning and 267.5MB in the end (delta: -34.1MB). Peak memory consumption was 27.2MB. Max. memory is 8.0GB. [2023-12-23 07:57:25,993 INFO L158 Benchmark]: TraceAbstraction took 875275.07ms. Allocated memory is still 309.3MB. Free memory was 267.0MB in the beginning and 229.2MB in the end (delta: 37.8MB). Peak memory consumption was 171.5MB. Max. memory is 8.0GB. [2023-12-23 07:57:25,994 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.14ms. Allocated memory is still 181.4MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 330.86ms. Allocated memory is still 309.3MB. Free memory was 258.2MB in the beginning and 240.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.26ms. Allocated memory is still 309.3MB. Free memory was 240.3MB in the beginning and 237.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.43ms. Allocated memory is still 309.3MB. Free memory was 237.6MB in the beginning and 233.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 10859.78ms. Allocated memory is still 309.3MB. Free memory was 233.4MB in the beginning and 267.5MB in the end (delta: -34.1MB). Peak memory consumption was 27.2MB. Max. memory is 8.0GB. * TraceAbstraction took 875275.07ms. Allocated memory is still 309.3MB. Free memory was 267.0MB in the beginning and 229.2MB in the end (delta: 37.8MB). Peak memory consumption was 171.5MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 221 with TraceHistMax 36,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-17-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 875.2s, OverallIterations: 5, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 50.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 49.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 1085 SdHoareTripleChecker+Invalid, 49.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 523 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 593 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 562 mSDtfsCounter, 593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1105 GetRequests, 1085 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 104 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 880 NumberOfCodeBlocks, 880 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 1095 ConstructedInterpolants, 0 QuantifiedInterpolants, 1824 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1451 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 12426/12600 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown