/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_fillercodesize_ps-cn-50_file-46.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 06:13:50,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 06:13:50,373 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 06:13:50,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 06:13:50,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 06:13:50,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 06:13:50,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 06:13:50,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 06:13:50,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 06:13:50,409 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 06:13:50,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 06:13:50,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 06:13:50,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 06:13:50,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 06:13:50,411 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 06:13:50,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 06:13:50,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 06:13:50,412 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 06:13:50,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 06:13:50,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 06:13:50,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 06:13:50,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 06:13:50,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 06:13:50,413 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 06:13:50,413 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 06:13:50,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 06:13:50,413 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 06:13:50,414 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 06:13:50,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 06:13:50,414 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 06:13:50,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 06:13:50,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 06:13:50,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 06:13:50,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 06:13:50,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 06:13:50,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 06:13:50,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 06:13:50,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 06:13:50,416 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 06:13:50,416 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 06:13:50,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 06:13:50,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 06:13:50,416 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 06:13:50,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 06:13:50,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 06:13:50,417 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 06:13:50,417 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 06:13:50,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 06:13:50,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 06:13:50,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 06:13:50,655 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 06:13:50,655 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 06:13:50,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-46.i [2023-12-23 06:13:51,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 06:13:52,105 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 06:13:52,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-46.i [2023-12-23 06:13:52,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88658fcb8/6bf3d31bc5334438825c33068cfa6352/FLAGdc5da0df6 [2023-12-23 06:13:52,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88658fcb8/6bf3d31bc5334438825c33068cfa6352 [2023-12-23 06:13:52,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 06:13:52,164 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 06:13:52,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 06:13:52,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 06:13:52,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 06:13:52,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fbfb0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52, skipping insertion in model container [2023-12-23 06:13:52,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,212 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 06:13:52,347 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_fillercodesize_ps-cn-50_file-46.i[915,928] [2023-12-23 06:13:52,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 06:13:52,445 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 06:13:52,473 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_fillercodesize_ps-cn-50_file-46.i[915,928] [2023-12-23 06:13:52,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 06:13:52,537 INFO L206 MainTranslator]: Completed translation [2023-12-23 06:13:52,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52 WrapperNode [2023-12-23 06:13:52,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 06:13:52,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 06:13:52,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 06:13:52,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 06:13:52,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,587 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2023-12-23 06:13:52,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 06:13:52,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 06:13:52,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 06:13:52,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 06:13:52,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,670 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 06:13:52,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 06:13:52,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 06:13:52,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 06:13:52,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 06:13:52,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (1/1) ... [2023-12-23 06:13:52,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 06:13:52,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 06:13:52,780 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 06:13:52,792 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 06:13:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 06:13:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 06:13:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 06:13:52,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 06:13:52,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 06:13:52,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 06:13:52,905 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 06:13:52,908 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 06:14:06,368 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 06:14:06,460 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 06:14:06,461 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 06:14:06,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:14:06 BoogieIcfgContainer [2023-12-23 06:14:06,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 06:14:06,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 06:14:06,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 06:14:06,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 06:14:06,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:13:52" (1/3) ... [2023-12-23 06:14:06,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7661f0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:14:06, skipping insertion in model container [2023-12-23 06:14:06,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:13:52" (2/3) ... [2023-12-23 06:14:06,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7661f0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:14:06, skipping insertion in model container [2023-12-23 06:14:06,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:14:06" (3/3) ... [2023-12-23 06:14:06,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-46.i [2023-12-23 06:14:06,483 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 06:14:06,484 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 06:14:06,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 06:14:06,555 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;@6dd8b8d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 06:14:06,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 06:14:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-23 06:14:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-23 06:14:06,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 06:14:06,580 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:06,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 06:14:06,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 06:14:06,585 INFO L85 PathProgramCache]: Analyzing trace with hash -550138528, now seen corresponding path program 1 times [2023-12-23 06:14:06,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 06:14:06,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692962964] [2023-12-23 06:14:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 06:14:06,598 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 06:14:06,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 06:14:06,601 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 06:14:06,602 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 06:14:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 06:14:07,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 06:14:07,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 06:14:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2023-12-23 06:14:07,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 06:14:07,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 06:14:07,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692962964] [2023-12-23 06:14:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692962964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 06:14:07,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 06:14:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 06:14:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328185449] [2023-12-23 06:14:07,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 06:14:07,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 06:14:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 06:14:07,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 06:14:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 06:14:07,849 INFO L87 Difference]: Start difference. First operand has 92 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-12-23 06:14:12,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.96s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:14:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 06:14:12,888 INFO L93 Difference]: Finished difference Result 180 states and 335 transitions. [2023-12-23 06:14:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 06:14:13,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 233 [2023-12-23 06:14:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 06:14:13,169 INFO L225 Difference]: With dead ends: 180 [2023-12-23 06:14:13,169 INFO L226 Difference]: Without dead ends: 89 [2023-12-23 06:14:13,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 232 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 06:14:13,175 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-23 06:14:13,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2023-12-23 06:14:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-23 06:14:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-23 06:14:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-23 06:14:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 141 transitions. [2023-12-23 06:14:13,213 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 141 transitions. Word has length 233 [2023-12-23 06:14:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 06:14:13,213 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 141 transitions. [2023-12-23 06:14:13,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-12-23 06:14:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 141 transitions. [2023-12-23 06:14:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-23 06:14:13,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 06:14:13,218 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:13,239 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 06:14:13,437 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 06:14:13,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 06:14:13,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 06:14:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1692192997, now seen corresponding path program 1 times [2023-12-23 06:14:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 06:14:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316054294] [2023-12-23 06:14:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 06:14:13,441 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 06:14:13,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 06:14:13,442 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 06:14:13,446 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 06:14:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 06:14:14,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-23 06:14:14,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 06:14:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1388 proven. 39 refuted. 0 times theorem prover too weak. 1537 trivial. 0 not checked. [2023-12-23 06:14:16,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 06:14:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 75 proven. 39 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2023-12-23 06:14:17,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 06:14:17,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316054294] [2023-12-23 06:14:17,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316054294] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 06:14:17,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 06:14:17,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-23 06:14:17,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543632307] [2023-12-23 06:14:17,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 06:14:17,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-23 06:14:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 06:14:17,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-23 06:14:17,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-23 06:14:17,642 INFO L87 Difference]: Start difference. First operand 89 states and 141 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2023-12-23 06:14:25,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:14:29,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:14:33,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:14:37,324 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 06:14:41,329 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 06:14:45,339 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 06:14:49,349 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 06:14:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 06:14:50,452 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2023-12-23 06:14:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-23 06:14:50,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 234 [2023-12-23 06:14:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 06:14:50,456 INFO L225 Difference]: With dead ends: 277 [2023-12-23 06:14:50,456 INFO L226 Difference]: Without dead ends: 189 [2023-12-23 06:14:50,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 460 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2023-12-23 06:14:50,458 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 199 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 144 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2023-12-23 06:14:50,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 289 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 31.9s Time] [2023-12-23 06:14:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-23 06:14:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2023-12-23 06:14:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-23 06:14:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 285 transitions. [2023-12-23 06:14:50,539 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 285 transitions. Word has length 234 [2023-12-23 06:14:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 06:14:50,542 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 285 transitions. [2023-12-23 06:14:50,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2023-12-23 06:14:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 285 transitions. [2023-12-23 06:14:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-23 06:14:50,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 06:14:50,553 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:50,580 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 06:14:50,779 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 06:14:50,780 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 06:14:50,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 06:14:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1950358435, now seen corresponding path program 1 times [2023-12-23 06:14:50,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 06:14:50,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136081963] [2023-12-23 06:14:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 06:14:50,782 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 06:14:50,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 06:14:50,785 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 06:14:50,808 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 06:18:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 06:18:12,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 06:18:12,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 06:18:32,306 WARN L293 SmtUtils]: Spent 8.54s 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 06:18:36,593 WARN L854 $PredicateComparison]: unable to prove that (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) is different from false [2023-12-23 06:18:40,771 WARN L876 $PredicateComparison]: unable to prove that (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) is different from true [2023-12-23 06:18:53,681 WARN L293 SmtUtils]: Spent 8.61s 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 06:19:06,576 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 06:19:19,476 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 06:19:32,317 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 06:19:45,183 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 06:19:58,040 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 06:20:10,966 WARN L293 SmtUtils]: Spent 8.63s 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 06:20:23,919 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 06:20:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2023-12-23 06:20:23,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 06:20:23,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 06:20:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136081963] [2023-12-23 06:20:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136081963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 06:20:23,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 06:20:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 06:20:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299086417] [2023-12-23 06:20:23,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 06:20:23,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-23 06:20:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 06:20:23,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-23 06:20:23,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=7, Unknown=2, NotChecked=4, Total=20 [2023-12-23 06:20:23,923 INFO L87 Difference]: Start difference. First operand 183 states and 285 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-23 06:20:29,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:20:33,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)))) (and (= c_~var_1_17~0 .cse0) (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) (= c_~last_1_var_1_17~0 .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-23 06:20:38,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:20:43,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.82s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:20:47,980 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 06:20:51,992 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 06:20:55,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:21:00,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:21:04,914 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 06:21:09,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:21:14,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:21:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 06:21:14,003 INFO L93 Difference]: Finished difference Result 315 states and 487 transitions. [2023-12-23 06:21:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-23 06:21:14,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 234 [2023-12-23 06:21:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 06:21:14,294 INFO L225 Difference]: With dead ends: 315 [2023-12-23 06:21:14,294 INFO L226 Difference]: Without dead ends: 313 [2023-12-23 06:21:14,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2023-12-23 06:21:14,295 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 82 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 79 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 45.4s IncrementalHoareTripleChecker+Time [2023-12-23 06:21:14,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 426 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 16 Invalid, 9 Unknown, 321 Unchecked, 45.4s Time] [2023-12-23 06:21:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-12-23 06:21:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 287. [2023-12-23 06:21:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 117 states have call successors, (117), 6 states have call predecessors, (117), 6 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2023-12-23 06:21:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 447 transitions. [2023-12-23 06:21:14,334 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 447 transitions. Word has length 234 [2023-12-23 06:21:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 06:21:14,335 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 447 transitions. [2023-12-23 06:21:14,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-23 06:21:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 447 transitions. [2023-12-23 06:21:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-23 06:21:14,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 06:21:14,337 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:14,367 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 06:21:14,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 06:21:14,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 06:21:14,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 06:21:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1141011809, now seen corresponding path program 1 times [2023-12-23 06:21:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 06:21:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182145279] [2023-12-23 06:21:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 06:21:14,566 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 06:21:14,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 06:21:14,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 06:21:14,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-23 06:23:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 06:23:22,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 06:23:22,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 06:23:42,920 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 06:23:47,181 WARN L854 $PredicateComparison]: unable to prove that (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) is different from false [2023-12-23 06:23:51,352 WARN L876 $PredicateComparison]: unable to prove that (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) is different from true [2023-12-23 06:24:04,107 WARN L293 SmtUtils]: Spent 8.51s 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 06:24:16,920 WARN L293 SmtUtils]: Spent 8.52s 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 06:24:29,698 WARN L293 SmtUtils]: Spent 8.51s 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 06:24:42,524 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 06:24:55,329 WARN L293 SmtUtils]: Spent 8.53s 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 06:25:08,124 WARN L293 SmtUtils]: Spent 8.53s 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 06:25:20,973 WARN L293 SmtUtils]: Spent 8.61s 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 06:25:33,810 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 06:25:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2023-12-23 06:25:33,812 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 06:25:33,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 06:25:33,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182145279] [2023-12-23 06:25:33,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182145279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 06:25:33,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 06:25:33,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 06:25:33,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484646059] [2023-12-23 06:25:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 06:25:33,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-23 06:25:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 06:25:33,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-23 06:25:33,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=7, Unknown=2, NotChecked=4, Total=20 [2023-12-23 06:25:33,814 INFO L87 Difference]: Start difference. First operand 287 states and 447 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-23 06:25:38,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:25:43,396 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 255.0 2.0)))) (and (= c_~var_1_17~0 .cse0) (exists ((~var_1_11~0 (_ FloatingPoint 8 24))) (fp.eq (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 255.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven ~var_1_11~0)) ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 4999998.0 5.0))))) (= c_~last_1_var_1_17~0 .cse0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-23 06:25:48,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:25:53,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:25:57,599 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 06:26:01,610 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 06:26:05,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:26:09,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:26:14,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:26:18,734 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 06:26:23,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:26:27,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 06:26:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 06:26:27,831 INFO L93 Difference]: Finished difference Result 327 states and 503 transitions. [2023-12-23 06:26:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-23 06:26:28,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 234 [2023-12-23 06:26:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 06:26:28,117 INFO L225 Difference]: With dead ends: 327 [2023-12-23 06:26:28,117 INFO L226 Difference]: Without dead ends: 325 [2023-12-23 06:26:28,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2023-12-23 06:26:28,118 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 82 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 79 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 49.3s IncrementalHoareTripleChecker+Time [2023-12-23 06:26:28,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 422 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 15 Invalid, 10 Unknown, 321 Unchecked, 49.3s Time] [2023-12-23 06:26:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-23 06:26:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 287. [2023-12-23 06:26:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 117 states have call successors, (117), 6 states have call predecessors, (117), 6 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2023-12-23 06:26:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 447 transitions. [2023-12-23 06:26:28,142 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 447 transitions. Word has length 234 [2023-12-23 06:26:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 06:26:28,143 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 447 transitions. [2023-12-23 06:26:28,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-23 06:26:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 447 transitions. [2023-12-23 06:26:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-23 06:26:28,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 06:26:28,145 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:28,193 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 (5)] Ended with exit code 0 [2023-12-23 06:26:28,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 06:26:28,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 06:26:28,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 06:26:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1557331425, now seen corresponding path program 1 times [2023-12-23 06:26:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 06:26:28,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624455415] [2023-12-23 06:26:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 06:26:28,383 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 06:26:28,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 06:26:28,387 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 06:26:28,388 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 06:26:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 06:26:29,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-23 06:26:29,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 06:26:55,291 WARN L293 SmtUtils]: Spent 8.67s 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 06:27:04,724 WARN L293 SmtUtils]: Spent 9.43s 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 06:27:13,862 WARN L293 SmtUtils]: Spent 9.14s 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 06:27:22,985 WARN L293 SmtUtils]: Spent 9.12s 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 06:27:32,082 WARN L293 SmtUtils]: Spent 9.10s 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 06:27:41,142 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 06:27:45,424 WARN L854 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.div c_currentRoundingMode c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 4999998.0 5.0))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-23 06:27:49,739 WARN L876 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.div c_currentRoundingMode c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_11~0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 4999998.0 5.0))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (and (fp.geq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-12-23 06:27:58,317 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 06:28:07,481 WARN L293 SmtUtils]: Spent 9.16s 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 06:28:16,630 WARN L293 SmtUtils]: Spent 9.15s 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 06:28:25,802 WARN L293 SmtUtils]: Spent 9.17s 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 06:28:34,872 WARN L293 SmtUtils]: Spent 9.07s 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) Received shutdown request... [2023-12-23 06:28:35,367 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 06:28:35,367 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 06:28:36,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-23 06:28:36,580 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 06:28:36,669 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 06:28:36,672 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 06:28:36,672 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 235 with TraceHistMax 39,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-23 06:28:36,676 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-23 06:28:36,678 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 06:28:36,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 06:28:36 BoogieIcfgContainer [2023-12-23 06:28:36,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 06:28:36,680 INFO L158 Benchmark]: Toolchain (without parser) took 884516.78ms. Allocated memory was 187.7MB in the beginning and 290.5MB in the end (delta: 102.8MB). Free memory was 127.2MB in the beginning and 116.0MB in the end (delta: 11.2MB). Peak memory consumption was 114.3MB. Max. memory is 8.0GB. [2023-12-23 06:28:36,680 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 06:28:36,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.64ms. Allocated memory is still 187.7MB. Free memory was 126.9MB in the beginning and 110.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-23 06:28:36,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.24ms. Allocated memory is still 187.7MB. Free memory was 110.4MB in the beginning and 107.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 06:28:36,681 INFO L158 Benchmark]: Boogie Preprocessor took 121.95ms. Allocated memory was 187.7MB in the beginning and 290.5MB in the end (delta: 102.8MB). Free memory was 107.8MB in the beginning and 257.0MB in the end (delta: -149.2MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2023-12-23 06:28:36,681 INFO L158 Benchmark]: RCFGBuilder took 13749.80ms. Allocated memory is still 290.5MB. Free memory was 256.5MB in the beginning and 224.5MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-23 06:28:36,682 INFO L158 Benchmark]: TraceAbstraction took 870216.73ms. Allocated memory is still 290.5MB. Free memory was 223.4MB in the beginning and 116.0MB in the end (delta: 107.5MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2023-12-23 06:28:36,683 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 373.64ms. Allocated memory is still 187.7MB. Free memory was 126.9MB in the beginning and 110.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.24ms. Allocated memory is still 187.7MB. Free memory was 110.4MB in the beginning and 107.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 121.95ms. Allocated memory was 187.7MB in the beginning and 290.5MB in the end (delta: 102.8MB). Free memory was 107.8MB in the beginning and 257.0MB in the end (delta: -149.2MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * RCFGBuilder took 13749.80ms. Allocated memory is still 290.5MB. Free memory was 256.5MB in the beginning and 224.5MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 870216.73ms. Allocated memory is still 290.5MB. Free memory was 223.4MB in the beginning and 116.0MB in the end (delta: 107.5MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 235 with TraceHistMax 39,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 870.2s, OverallIterations: 5, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 142.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 131.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 1275 SdHoareTripleChecker+Invalid, 129.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 642 IncrementalHoareTripleChecker+Unchecked, 746 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 293 IncrementalHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 529 mSDtfsCounter, 293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1179 GetRequests, 1152 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=3, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 70 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 331.7s SatisfiabilityAnalysisTime, 265.7s InterpolantComputationTime, 935 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 1164 ConstructedInterpolants, 18 QuantifiedInterpolants, 5337 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1505 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 14742/14820 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