/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-pr-ci_file-32.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 10:42:18,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 10:42:18,280 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 10:42:18,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 10:42:18,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 10:42:18,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 10:42:18,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 10:42:18,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 10:42:18,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 10:42:18,320 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 10:42:18,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 10:42:18,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 10:42:18,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 10:42:18,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 10:42:18,322 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 10:42:18,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 10:42:18,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 10:42:18,323 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 10:42:18,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 10:42:18,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 10:42:18,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 10:42:18,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 10:42:18,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 10:42:18,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 10:42:18,325 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 10:42:18,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 10:42:18,325 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 10:42:18,326 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 10:42:18,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 10:42:18,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 10:42:18,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 10:42:18,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 10:42:18,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 10:42:18,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 10:42:18,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 10:42:18,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 10:42:18,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 10:42:18,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 10:42:18,327 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 10:42:18,327 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 10:42:18,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 10:42:18,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 10:42:18,328 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 10:42:18,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 10:42:18,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 10:42:18,328 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 10:42:18,328 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 10:42:18,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 10:42:18,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 10:42:18,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 10:42:18,545 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 10:42:18,545 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 10:42:18,546 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-pr-ci_file-32.i [2023-12-23 10:42:19,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 10:42:19,678 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 10:42:19,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2023-12-23 10:42:19,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd128d5a6/2b13bb4a1ee54c32b051c2195e6efef7/FLAG05bb4b6c2 [2023-12-23 10:42:19,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd128d5a6/2b13bb4a1ee54c32b051c2195e6efef7 [2023-12-23 10:42:19,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 10:42:19,703 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 10:42:19,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 10:42:19,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 10:42:19,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 10:42:19,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:42:19" (1/1) ... [2023-12-23 10:42:19,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5058bfef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:19, skipping insertion in model container [2023-12-23 10:42:19,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:42:19" (1/1) ... [2023-12-23 10:42:19,742 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 10:42:19,858 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-pr-ci_file-32.i[919,932] [2023-12-23 10:42:19,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 10:42:19,944 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 10:42:19,961 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-pr-ci_file-32.i[919,932] [2023-12-23 10:42:19,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 10:42:20,002 INFO L206 MainTranslator]: Completed translation [2023-12-23 10:42:20,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20 WrapperNode [2023-12-23 10:42:20,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 10:42:20,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 10:42:20,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 10:42:20,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 10:42:20,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,040 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2023-12-23 10:42:20,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 10:42:20,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 10:42:20,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 10:42:20,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 10:42:20,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,062 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 10:42:20,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 10:42:20,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 10:42:20,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 10:42:20,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 10:42:20,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (1/1) ... [2023-12-23 10:42:20,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 10:42:20,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 10:42:20,129 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 10:42:20,138 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 10:42:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 10:42:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 10:42:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 10:42:20,154 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 10:42:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 10:42:20,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 10:42:20,217 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 10:42:20,219 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 10:42:42,828 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 10:42:42,871 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 10:42:42,871 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 10:42:42,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:42:42 BoogieIcfgContainer [2023-12-23 10:42:42,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 10:42:42,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 10:42:42,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 10:42:42,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 10:42:42,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:42:19" (1/3) ... [2023-12-23 10:42:42,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7f3ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:42:42, skipping insertion in model container [2023-12-23 10:42:42,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:42:20" (2/3) ... [2023-12-23 10:42:42,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7f3ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:42:42, skipping insertion in model container [2023-12-23 10:42:42,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:42:42" (3/3) ... [2023-12-23 10:42:42,877 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2023-12-23 10:42:42,892 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 10:42:42,892 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 10:42:42,927 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 10:42:42,931 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;@5738cf5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 10:42:42,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 10:42:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 48 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-23 10:42:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-23 10:42:42,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:42:42,953 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:42:42,953 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:42:42,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:42:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash -528789016, now seen corresponding path program 1 times [2023-12-23 10:42:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:42:42,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802322499] [2023-12-23 10:42:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:42:42,972 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 10:42:42,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:42:42,974 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 10:42:42,988 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 10:42:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:42:44,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 10:42:44,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:42:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2023-12-23 10:42:44,637 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 10:42:44,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:42:44,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802322499] [2023-12-23 10:42:44,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802322499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 10:42:44,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 10:42:44,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 10:42:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896005138] [2023-12-23 10:42:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 10:42:44,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 10:42:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:42:44,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 10:42:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 10:42:44,672 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 48 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-23 10:42:47,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:42:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 10:42:47,191 INFO L93 Difference]: Finished difference Result 141 states and 259 transitions. [2023-12-23 10:42:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 10:42:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2023-12-23 10:42:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 10:42:47,226 INFO L225 Difference]: With dead ends: 141 [2023-12-23 10:42:47,227 INFO L226 Difference]: Without dead ends: 69 [2023-12-23 10:42:47,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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 10:42:47,231 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-23 10:42:47,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-23 10:42:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-23 10:42:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-12-23 10:42:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-23 10:42:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 110 transitions. [2023-12-23 10:42:47,259 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 110 transitions. Word has length 147 [2023-12-23 10:42:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 10:42:47,260 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 110 transitions. [2023-12-23 10:42:47,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-23 10:42:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 110 transitions. [2023-12-23 10:42:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-23 10:42:47,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:42:47,264 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:42:47,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-23 10:42:47,465 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 10:42:47,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:42:47,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:42:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1154434782, now seen corresponding path program 1 times [2023-12-23 10:42:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:42:47,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829912015] [2023-12-23 10:42:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:42:47,467 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 10:42:47,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:42:47,468 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 10:42:47,470 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 10:42:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:42:48,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 10:42:48,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:42:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2023-12-23 10:42:50,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 10:42:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-23 10:42:51,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:42:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829912015] [2023-12-23 10:42:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829912015] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 10:42:51,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 10:42:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-23 10:42:51,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841029750] [2023-12-23 10:42:51,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 10:42:51,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-23 10:42:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:42:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-23 10:42:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-23 10:42:51,419 INFO L87 Difference]: Start difference. First operand 69 states and 110 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-23 10:42:55,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:42:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 10:42:56,473 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2023-12-23 10:42:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-23 10:42:56,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 147 [2023-12-23 10:42:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 10:42:56,478 INFO L225 Difference]: With dead ends: 168 [2023-12-23 10:42:56,479 INFO L226 Difference]: Without dead ends: 100 [2023-12-23 10:42:56,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-23 10:42:56,481 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 170 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-23 10:42:56,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 221 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-23 10:42:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-23 10:42:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2023-12-23 10:42:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 56 states have internal predecessors, (74), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-23 10:42:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2023-12-23 10:42:56,512 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 147 [2023-12-23 10:42:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 10:42:56,513 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2023-12-23 10:42:56,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-23 10:42:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2023-12-23 10:42:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-23 10:42:56,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:42:56,520 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:42:56,554 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 10:42:56,730 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 10:42:56,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:42:56,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:42:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 127595486, now seen corresponding path program 1 times [2023-12-23 10:42:56,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:42:56,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699210100] [2023-12-23 10:42:56,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:42:56,732 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 10:42:56,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:42:56,733 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 10:42:56,734 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 10:42:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:42:58,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-23 10:42:58,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:43:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 150 proven. 177 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2023-12-23 10:43:12,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 10:43:12,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:43:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699210100] [2023-12-23 10:43:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699210100] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 10:43:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [697288552] [2023-12-23 10:43:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:43:12,760 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 10:43:12,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 10:43:12,799 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 10:43:12,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-23 10:43:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:43:14,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 10:43:14,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:43:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-23 10:43:18,226 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 10:43:18,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [697288552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 10:43:18,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 10:43:18,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2023-12-23 10:43:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776948220] [2023-12-23 10:43:18,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 10:43:18,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 10:43:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:43:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 10:43:18,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-23 10:43:18,228 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-23 10:43:20,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:43:23,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:43:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 10:43:23,927 INFO L93 Difference]: Finished difference Result 239 states and 370 transitions. [2023-12-23 10:43:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 10:43:23,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2023-12-23 10:43:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 10:43:23,930 INFO L225 Difference]: With dead ends: 239 [2023-12-23 10:43:23,930 INFO L226 Difference]: Without dead ends: 167 [2023-12-23 10:43:23,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-23 10:43:23,931 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 29 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-23 10:43:23,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 201 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-23 10:43:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-23 10:43:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2023-12-23 10:43:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 100 states have internal predecessors, (135), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-23 10:43:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 255 transitions. [2023-12-23 10:43:23,963 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 255 transitions. Word has length 148 [2023-12-23 10:43:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 10:43:23,963 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 255 transitions. [2023-12-23 10:43:23,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-23 10:43:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 255 transitions. [2023-12-23 10:43:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-23 10:43:23,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:43:23,965 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:23,997 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 10:43:24,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-23 10:43:24,379 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-23 10:43:24,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:43:24,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:43:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash 129442528, now seen corresponding path program 1 times [2023-12-23 10:43:24,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:43:24,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645732692] [2023-12-23 10:43:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:43:24,381 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 10:43:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:43:24,382 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 10:43:24,392 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 10:43:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:43:25,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-23 10:43:25,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:43:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 150 proven. 177 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2023-12-23 10:43:39,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 10:43:39,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:43:39,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645732692] [2023-12-23 10:43:39,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645732692] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 10:43:39,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [200345102] [2023-12-23 10:43:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:43:39,901 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 10:43:39,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 10:43:39,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 10:43:39,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-23 10:43:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:43:42,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 10:43:42,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:43:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 150 proven. 177 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2023-12-23 10:43:54,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 10:43:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [200345102] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 10:43:54,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 10:43:54,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-12-23 10:43:54,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11165933] [2023-12-23 10:43:54,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 10:43:54,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-23 10:43:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:43:54,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-23 10:43:54,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-23 10:43:54,801 INFO L87 Difference]: Start difference. First operand 164 states and 255 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (23), 4 states have call predecessors, (23), 5 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-12-23 10:44:04,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:44:08,034 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 10:44:13,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:44:15,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:44:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 10:44:16,016 INFO L93 Difference]: Finished difference Result 425 states and 623 transitions. [2023-12-23 10:44:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-23 10:44:16,017 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (23), 4 states have call predecessors, (23), 5 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 148 [2023-12-23 10:44:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 10:44:16,019 INFO L225 Difference]: With dead ends: 425 [2023-12-23 10:44:16,019 INFO L226 Difference]: Without dead ends: 284 [2023-12-23 10:44:16,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2023-12-23 10:44:16,020 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 70 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-23 10:44:16,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 552 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 345 Invalid, 2 Unknown, 0 Unchecked, 20.1s Time] [2023-12-23 10:44:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-12-23 10:44:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 270. [2023-12-23 10:44:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 171 states have (on average 1.3099415204678362) internal successors, (224), 172 states have internal predecessors, (224), 83 states have call successors, (83), 15 states have call predecessors, (83), 15 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2023-12-23 10:44:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 390 transitions. [2023-12-23 10:44:16,043 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 390 transitions. Word has length 148 [2023-12-23 10:44:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 10:44:16,043 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 390 transitions. [2023-12-23 10:44:16,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (23), 4 states have call predecessors, (23), 5 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-12-23 10:44:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 390 transitions. [2023-12-23 10:44:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-23 10:44:16,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 10:44:16,045 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:44:16,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-23 10:44:16,292 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 (6)] Ended with exit code 0 [2023-12-23 10:44:16,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 10:44:16,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 10:44:16,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 10:44:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash -86273662, now seen corresponding path program 1 times [2023-12-23 10:44:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 10:44:16,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588289302] [2023-12-23 10:44:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:44:16,466 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 10:44:16,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 10:44:16,466 INFO L229 MonitoredProcess]: Starting monitored process 8 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 10:44:16,467 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 (8)] Waiting until timeout for monitored process [2023-12-23 10:44:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:44:17,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-23 10:44:17,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:44:48,929 WARN L293 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 10:44:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 536 proven. 66 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2023-12-23 10:44:55,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 10:45:33,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 10:45:33,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588289302] [2023-12-23 10:45:33,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588289302] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 10:45:33,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1087347246] [2023-12-23 10:45:33,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 10:45:33,975 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 10:45:33,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 10:45:33,977 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 10:45:33,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-23 10:45:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 10:45:37,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 10:45:37,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 10:46:17,141 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:46:26,230 WARN L293 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:46:35,734 WARN L293 SmtUtils]: Spent 9.50s 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 10:46:44,372 WARN L293 SmtUtils]: Spent 8.64s 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 10:46:52,977 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:47:01,603 WARN L293 SmtUtils]: Spent 8.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 10:47:09,978 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:47:18,545 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:47:27,498 WARN L293 SmtUtils]: Spent 8.95s 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 10:47:33,424 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (and (fp.geq c_~var_1_11~0 .cse0) (fp.leq c_~var_1_11~0 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (let ((.cse1 (fp.neg c_~var_1_18~0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven c_~var_1_11~0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 513.0 2.0)))) (or (exists ((~var_1_12~0 (_ FloatingPoint 8 24))) (and (not (fp.gt (fp.mul roundNearestTiesToEven ~var_1_12~0 c_~var_1_18~0) .cse1)) (fp.lt (fp.div roundNearestTiesToEven .cse2 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_12~0)) (fp.leq ~var_1_12~0 .cse4) (fp.geq ~var_1_12~0 .cse0))) (exists ((~var_1_12~0 (_ FloatingPoint 8 24))) (and (not (fp.gt (fp.mul roundNearestTiesToEven ~var_1_12~0 c_~var_1_18~0) .cse1)) (fp.leq ~var_1_12~0 .cse4) (exists ((~var_1_42~0 (_ FloatingPoint 11 53))) (and (fp.lt (fp.div roundNearestTiesToEven .cse2 ~var_1_42~0) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_12~0)) (fp.gt ~var_1_42~0 .cse3))) (fp.geq ~var_1_12~0 .cse0))))))) is different from false [2023-12-23 10:47:46,502 WARN L293 SmtUtils]: Spent 8.64s 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 10:47:55,115 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:48:03,765 WARN L293 SmtUtils]: Spent 8.65s 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 10:48:12,157 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:48:20,774 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:48:29,750 WARN L293 SmtUtils]: Spent 8.98s 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 10:48:44,314 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:49:03,074 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:49:09,881 WARN L293 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 5 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:49:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 536 proven. 66 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2023-12-23 10:49:09,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 10:49:18,954 WARN L293 SmtUtils]: Spent 9.01s 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 10:49:27,509 WARN L293 SmtUtils]: Spent 8.55s 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 10:49:36,447 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:49:46,167 WARN L293 SmtUtils]: Spent 9.72s 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 10:49:50,472 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.eq c_~var_1_11~0 c_~var_1_18~0)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 513.0 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0))) (and (or (forall ((~var_1_42~0 (_ FloatingPoint 11 53))) (fp.gt ~var_1_42~0 .cse0)) (not (fp.lt (fp.div c_currentRoundingMode .cse1 .cse0) .cse2))) (forall ((~var_1_42~0 (_ FloatingPoint 11 53))) (or (not (fp.gt ~var_1_42~0 .cse0)) (not (fp.lt (fp.div c_currentRoundingMode .cse1 ~var_1_42~0) .cse2))))))) is different from false [2023-12-23 10:49:55,201 WARN L876 $PredicateComparison]: unable to prove that (or (not (fp.eq c_~var_1_11~0 c_~var_1_18~0)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 513.0 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0))) (and (or (forall ((~var_1_42~0 (_ FloatingPoint 11 53))) (fp.gt ~var_1_42~0 .cse0)) (not (fp.lt (fp.div c_currentRoundingMode .cse1 .cse0) .cse2))) (forall ((~var_1_42~0 (_ FloatingPoint 11 53))) (or (not (fp.gt ~var_1_42~0 .cse0)) (not (fp.lt (fp.div c_currentRoundingMode .cse1 ~var_1_42~0) .cse2))))))) is different from true [2023-12-23 10:50:04,315 WARN L293 SmtUtils]: Spent 9.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 10:50:12,887 WARN L293 SmtUtils]: Spent 8.57s 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 10:50:21,848 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:50:31,583 WARN L293 SmtUtils]: Spent 9.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 10:50:39,342 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 513.0 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0))) (and (or (forall ((~var_1_42~0 (_ FloatingPoint 11 53))) (fp.gt ~var_1_42~0 .cse0)) (not (fp.lt (fp.div c_currentRoundingMode .cse1 .cse0) .cse2))) (forall ((~var_1_42~0 (_ FloatingPoint 11 53))) (or (not (fp.gt ~var_1_42~0 .cse0)) (not (fp.lt (fp.div c_currentRoundingMode .cse1 ~var_1_42~0) .cse2)))))) (and (forall ((~var_1_18~0 (_ FloatingPoint 8 24))) (or (not (fp.eq c_~var_1_11~0 ~var_1_18~0)) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ~var_1_18~0) (fp.neg ~var_1_18~0)))) (forall ((~var_1_18~0 (_ FloatingPoint 8 24))) (or (not (fp.eq c_~var_1_11~0 ~var_1_18~0)) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 c_~var_1_11~0) (fp.neg ~var_1_18~0)))))) is different from false [2023-12-23 10:50:44,126 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 513.0 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_12~0))) (and (or (forall ((~var_1_42~0 (_ FloatingPoint 11 53))) (fp.gt ~var_1_42~0 .cse0)) (not (fp.lt (fp.div c_currentRoundingMode .cse1 .cse0) .cse2))) (forall ((~var_1_42~0 (_ FloatingPoint 11 53))) (or (not (fp.gt ~var_1_42~0 .cse0)) (not (fp.lt (fp.div c_currentRoundingMode .cse1 ~var_1_42~0) .cse2)))))) (and (forall ((~var_1_18~0 (_ FloatingPoint 8 24))) (or (not (fp.eq c_~var_1_11~0 ~var_1_18~0)) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ~var_1_18~0) (fp.neg ~var_1_18~0)))) (forall ((~var_1_18~0 (_ FloatingPoint 8 24))) (or (not (fp.eq c_~var_1_11~0 ~var_1_18~0)) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 c_~var_1_11~0) (fp.neg ~var_1_18~0)))))) is different from true [2023-12-23 10:50:55,516 WARN L293 SmtUtils]: Spent 9.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 10:51:04,079 WARN L293 SmtUtils]: Spent 8.56s 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 10:51:13,029 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:51:22,710 WARN L293 SmtUtils]: Spent 9.68s 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 10:51:33,638 WARN L293 SmtUtils]: Spent 9.04s 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 10:51:42,213 WARN L293 SmtUtils]: Spent 8.57s 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 10:51:51,173 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:52:00,897 WARN L293 SmtUtils]: Spent 9.72s 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 10:52:10,086 WARN L293 SmtUtils]: Spent 5.79s 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 10:52:18,664 WARN L293 SmtUtils]: Spent 8.58s 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 10:52:27,645 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:52:37,448 WARN L293 SmtUtils]: Spent 9.80s 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 10:52:49,288 WARN L293 SmtUtils]: Spent 9.08s 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 10:52:57,884 WARN L293 SmtUtils]: Spent 8.60s 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 10:53:06,875 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:53:16,703 WARN L293 SmtUtils]: Spent 9.83s 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 10:53:27,408 WARN L293 SmtUtils]: Spent 9.04s 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 10:53:36,007 WARN L293 SmtUtils]: Spent 8.60s 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 10:53:45,003 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:53:54,788 WARN L293 SmtUtils]: Spent 9.78s 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 10:54:06,999 WARN L293 SmtUtils]: Spent 9.08s 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 10:54:15,588 WARN L293 SmtUtils]: Spent 8.59s 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 10:54:24,583 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:54:34,394 WARN L293 SmtUtils]: Spent 9.81s 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 10:54:46,253 WARN L293 SmtUtils]: Spent 9.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 10:54:54,856 WARN L293 SmtUtils]: Spent 8.60s 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 10:55:03,865 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:55:13,790 WARN L293 SmtUtils]: Spent 9.92s 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 10:55:25,435 WARN L293 SmtUtils]: Spent 9.13s 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 10:55:34,036 WARN L293 SmtUtils]: Spent 8.60s 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 10:55:43,103 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 10:55:53,032 WARN L293 SmtUtils]: Spent 9.93s 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 10:55:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1087347246] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 10:55:53,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 10:55:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2023-12-23 10:55:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963941181] [2023-12-23 10:55:53,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 10:55:53,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-23 10:55:53,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 10:55:53,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-23 10:55:53,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=113, Unknown=7, NotChecked=72, Total=240 [2023-12-23 10:55:53,035 INFO L87 Difference]: Start difference. First operand 270 states and 390 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2023-12-23 10:56:10,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 10:56:13,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 10:56:18,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:56:22,855 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 10:56:26,857 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 10:56:30,860 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 10:56:34,874 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 10:56:39,787 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse1 (fp.neg c_~var_1_18~0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (and (fp.geq c_~var_1_11~0 .cse0) (fp.leq c_~var_1_11~0 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 c_~var_1_18~0) .cse1)) (fp.geq c_~var_1_11~0 .cse2) (fp.leq c_~var_1_11~0 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (fp.leq c_~var_1_12~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (fp.geq c_~var_1_12~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven c_~var_1_11~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 513.0 2.0)))) (or (exists ((~var_1_12~0 (_ FloatingPoint 8 24))) (and (not (fp.gt (fp.mul roundNearestTiesToEven ~var_1_12~0 c_~var_1_18~0) .cse1)) (fp.lt (fp.div roundNearestTiesToEven .cse3 .cse4) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_12~0)) (fp.leq ~var_1_12~0 .cse5) (fp.geq ~var_1_12~0 .cse0))) (exists ((~var_1_12~0 (_ FloatingPoint 8 24))) (and (not (fp.gt (fp.mul roundNearestTiesToEven ~var_1_12~0 c_~var_1_18~0) .cse1)) (fp.leq ~var_1_12~0 .cse5) (exists ((~var_1_42~0 (_ FloatingPoint 11 53))) (and (fp.lt (fp.div roundNearestTiesToEven .cse3 ~var_1_42~0) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_12~0)) (fp.gt ~var_1_42~0 .cse4))) (fp.geq ~var_1_12~0 .cse0))))))) is different from false [2023-12-23 10:56:46,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:56:50,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 10:56:54,261 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 10:56:58,273 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 10:57:02,276 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 [] Received shutdown request... [2023-12-23 10:57:03,706 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 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 10:57:03,706 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 10:57:03,706 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 10:57:04,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-23 10:57:04,743 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 (8)] Forceful destruction successful, exit code 0 [2023-12-23 10:57:04,916 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-23 10:57:05,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-23 10:57:05,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 80.2s TimeCoverageRelationStatistics Valid=94, Invalid=220, Unknown=8, NotChecked=140, Total=462 [2023-12-23 10:57:05,059 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 58.2s IncrementalHoareTripleChecker+Time [2023-12-23 10:57:05,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 167 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 10 Unknown, 102 Unchecked, 58.2s Time] [2023-12-23 10:57:05,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 10:57:05,060 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-23 10:57:05,063 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-23 10:57:05,073 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 10:57:05,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 10:57:05 BoogieIcfgContainer [2023-12-23 10:57:05,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 10:57:05,075 INFO L158 Benchmark]: Toolchain (without parser) took 885372.63ms. Allocated memory is still 356.5MB. Free memory was 316.9MB in the beginning and 130.4MB in the end (delta: 186.5MB). Peak memory consumption was 187.7MB. Max. memory is 8.0GB. [2023-12-23 10:57:05,075 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 223.3MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 10:57:05,075 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.45ms. Allocated memory is still 356.5MB. Free memory was 316.9MB in the beginning and 301.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-23 10:57:05,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.22ms. Allocated memory is still 356.5MB. Free memory was 301.2MB in the beginning and 298.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 10:57:05,076 INFO L158 Benchmark]: Boogie Preprocessor took 37.81ms. Allocated memory is still 356.5MB. Free memory was 298.7MB in the beginning and 295.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-23 10:57:05,076 INFO L158 Benchmark]: RCFGBuilder took 22791.98ms. Allocated memory is still 356.5MB. Free memory was 295.2MB in the beginning and 268.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-23 10:57:05,076 INFO L158 Benchmark]: TraceAbstraction took 862201.93ms. Allocated memory is still 356.5MB. Free memory was 267.6MB in the beginning and 130.4MB in the end (delta: 137.2MB). Peak memory consumption was 138.4MB. Max. memory is 8.0GB. [2023-12-23 10:57:05,077 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.10ms. Allocated memory is still 223.3MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.45ms. Allocated memory is still 356.5MB. Free memory was 316.9MB in the beginning and 301.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.22ms. Allocated memory is still 356.5MB. Free memory was 301.2MB in the beginning and 298.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.81ms. Allocated memory is still 356.5MB. Free memory was 298.7MB in the beginning and 295.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 22791.98ms. Allocated memory is still 356.5MB. Free memory was 295.2MB in the beginning and 268.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 862201.93ms. Allocated memory is still 356.5MB. Free memory was 267.6MB in the beginning and 130.4MB in the end (delta: 137.2MB). Peak memory consumption was 138.4MB. 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 executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 862.1s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 106.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 91.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 1248 SdHoareTripleChecker+Invalid, 90.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 102 IncrementalHoareTripleChecker+Unchecked, 811 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 797 IncrementalHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 437 mSDtfsCounter, 797 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1440 GetRequests, 1381 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 85.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=4, InterpolantAutomatonStates: 30, 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, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 14.3s SatisfiabilityAnalysisTime, 739.3s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1322 ConstructedInterpolants, 3 QuantifiedInterpolants, 12028 SizeOfPredicates, 39 NumberOfNonLiveVariables, 2050 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 8397/9108 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