/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/nla-digbench-scaling/egcd2-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:45:50,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:45:50,985 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-25 01:45:50,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:45:50,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:45:51,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:45:51,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:45:51,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:45:51,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:45:51,020 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:45:51,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:45:51,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:45:51,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:45:51,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:45:51,028 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:45:51,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:45:51,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:45:51,029 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:45:51,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:45:51,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:45:51,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:45:51,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:45:51,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:45:51,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:45:51,032 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:45:51,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:45:51,032 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:45:51,033 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:45:51,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:45:51,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:45:51,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:45:51,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:45:51,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:45:51,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:45:51,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:45:51,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:45:51,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:45:51,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:45:51,035 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:45:51,035 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:45:51,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:45:51,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:45:51,036 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:45:51,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:45:51,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:45:51,037 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:45:51,037 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-25 01:45:51,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:45:51,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:45:51,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:45:51,277 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:45:51,277 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:45:51,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound10.c [2023-12-25 01:45:52,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:45:52,556 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:45:52,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound10.c [2023-12-25 01:45:52,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8130f3944/64633e000156463f8d38f2f1a6d9a3c0/FLAG1400850ba [2023-12-25 01:45:52,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8130f3944/64633e000156463f8d38f2f1a6d9a3c0 [2023-12-25 01:45:52,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:45:52,583 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:45:52,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:45:52,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:45:52,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:45:52,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725ea25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52, skipping insertion in model container [2023-12-25 01:45:52,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,607 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:45:52,715 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound10.c[490,503] [2023-12-25 01:45:52,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:45:52,749 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:45:52,758 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound10.c[490,503] [2023-12-25 01:45:52,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:45:52,779 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:45:52,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52 WrapperNode [2023-12-25 01:45:52,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:45:52,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:45:52,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:45:52,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:45:52,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,806 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2023-12-25 01:45:52,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:45:52,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:45:52,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:45:52,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:45:52,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,827 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-25 01:45:52,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:45:52,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:45:52,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:45:52,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:45:52,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (1/1) ... [2023-12-25 01:45:52,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:45:52,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:45:52,865 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-25 01:45:52,866 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-25 01:45:52,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:45:52,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:45:52,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:45:52,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:45:52,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:45:52,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:45:52,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:45:52,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:45:52,943 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:45:52,944 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:45:53,342 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:45:53,382 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:45:53,383 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:45:53,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:45:53 BoogieIcfgContainer [2023-12-25 01:45:53,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:45:53,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:45:53,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:45:53,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:45:53,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:45:52" (1/3) ... [2023-12-25 01:45:53,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f49fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:45:53, skipping insertion in model container [2023-12-25 01:45:53,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:45:52" (2/3) ... [2023-12-25 01:45:53,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f49fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:45:53, skipping insertion in model container [2023-12-25 01:45:53,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:45:53" (3/3) ... [2023-12-25 01:45:53,390 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd2-ll_valuebound10.c [2023-12-25 01:45:53,410 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:45:53,412 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:45:53,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:45:53,453 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;@37aea33a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:45:53,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:45:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 16 states have (on average 1.5625) internal successors, (25), 18 states have internal predecessors, (25), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 01:45:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 01:45:53,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:45:53,472 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:45:53,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:45:53,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:45:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1865535902, now seen corresponding path program 1 times [2023-12-25 01:45:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:45:53,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390275981] [2023-12-25 01:45:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:45:53,489 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-25 01:45:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:45:53,493 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-25 01:45:53,514 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-25 01:45:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:45:53,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:45:53,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:45:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-25 01:45:53,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:45:53,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:45:53,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390275981] [2023-12-25 01:45:53,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390275981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:45:53,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:45:53,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:45:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369613574] [2023-12-25 01:45:53,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:45:53,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:45:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:45:53,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:45:53,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:45:53,749 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.5625) internal successors, (25), 18 states have internal predecessors, (25), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:45:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:45:53,795 INFO L93 Difference]: Finished difference Result 62 states and 107 transitions. [2023-12-25 01:45:53,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:45:53,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2023-12-25 01:45:53,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:45:53,804 INFO L225 Difference]: With dead ends: 62 [2023-12-25 01:45:53,804 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 01:45:53,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 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-25 01:45:53,811 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:45:53,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:45:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 01:45:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-25 01:45:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:45:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-12-25 01:45:53,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 38 [2023-12-25 01:45:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:45:53,854 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-12-25 01:45:53,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:45:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-12-25 01:45:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 01:45:53,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:45:53,856 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:45:53,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 01:45:54,060 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-25 01:45:54,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:45:54,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:45:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash -279596905, now seen corresponding path program 1 times [2023-12-25 01:45:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:45:54,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346866939] [2023-12-25 01:45:54,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:45:54,062 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-25 01:45:54,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:45:54,064 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-25 01:45:54,065 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-25 01:45:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:45:54,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 01:45:54,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:45:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 01:45:54,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:45:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 01:45:54,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:45:54,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346866939] [2023-12-25 01:45:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346866939] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:45:54,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:45:54,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2023-12-25 01:45:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347706898] [2023-12-25 01:45:54,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:45:54,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 01:45:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:45:54,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 01:45:54,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:45:54,669 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2023-12-25 01:45:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:45:56,775 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-12-25 01:45:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 01:45:56,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 39 [2023-12-25 01:45:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:45:56,778 INFO L225 Difference]: With dead ends: 47 [2023-12-25 01:45:56,778 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 01:45:56,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:45:56,779 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:45:56,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 171 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-25 01:45:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 01:45:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-25 01:45:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:45:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-12-25 01:45:56,790 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 39 [2023-12-25 01:45:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:45:56,791 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-12-25 01:45:56,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2023-12-25 01:45:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-12-25 01:45:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 01:45:56,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:45:56,792 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:45:56,802 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 (3)] Ended with exit code 0 [2023-12-25 01:45:57,000 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-25 01:45:57,000 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:45:57,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:45:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash -76887146, now seen corresponding path program 1 times [2023-12-25 01:45:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:45:57,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310698350] [2023-12-25 01:45:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:45:57,002 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-25 01:45:57,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:45:57,003 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-25 01:45:57,009 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-25 01:45:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:45:57,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:45:57,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:45:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 01:45:58,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:45:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 01:45:59,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:45:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310698350] [2023-12-25 01:45:59,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310698350] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:45:59,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:45:59,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 01:45:59,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456007929] [2023-12-25 01:45:59,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:45:59,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:45:59,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:45:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:45:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:45:59,965 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 01:46:02,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:46:06,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:46:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:46:08,351 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2023-12-25 01:46:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:46:08,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2023-12-25 01:46:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:46:08,363 INFO L225 Difference]: With dead ends: 45 [2023-12-25 01:46:08,363 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 01:46:08,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:46:08,364 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:46:08,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2023-12-25 01:46:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 01:46:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2023-12-25 01:46:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 01:46:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2023-12-25 01:46:08,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 40 [2023-12-25 01:46:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:46:08,375 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2023-12-25 01:46:08,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-25 01:46:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2023-12-25 01:46:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 01:46:08,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:46:08,376 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:46:08,391 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-25 01:46:08,576 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-25 01:46:08,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:46:08,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:46:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 345761675, now seen corresponding path program 1 times [2023-12-25 01:46:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:46:08,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226059230] [2023-12-25 01:46:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:46:08,578 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-25 01:46:08,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:46:08,580 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-25 01:46:08,582 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-25 01:46:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:46:08,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:46:08,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:46:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 01:46:09,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:46:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 01:46:15,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:46:15,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226059230] [2023-12-25 01:46:15,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226059230] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:46:15,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:46:15,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 01:46:15,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196062319] [2023-12-25 01:46:15,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:46:15,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:46:15,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:46:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:46:15,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:46:15,542 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:46:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:46:20,420 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2023-12-25 01:46:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:46:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2023-12-25 01:46:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:46:20,436 INFO L225 Difference]: With dead ends: 53 [2023-12-25 01:46:20,437 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 01:46:20,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:46:20,438 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:46:20,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 136 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-25 01:46:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 01:46:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-12-25 01:46:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-25 01:46:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2023-12-25 01:46:20,452 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 45 [2023-12-25 01:46:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:46:20,452 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2023-12-25 01:46:20,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 01:46:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2023-12-25 01:46:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 01:46:20,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:46:20,454 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:46:20,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 01:46:20,660 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-25 01:46:20,661 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:46:20,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:46:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash -954985354, now seen corresponding path program 1 times [2023-12-25 01:46:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:46:20,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082521969] [2023-12-25 01:46:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:46:20,662 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-25 01:46:20,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:46:20,663 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-25 01:46:20,668 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-25 01:46:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:46:20,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 01:46:20,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:46:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 01:46:22,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:46:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 01:46:28,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:46:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082521969] [2023-12-25 01:46:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082521969] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:46:28,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:46:28,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 01:46:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821448099] [2023-12-25 01:46:28,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:46:28,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:46:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:46:28,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:46:28,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 01:46:28,232 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 01:46:31,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:46:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:46:35,478 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2023-12-25 01:46:35,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:46:35,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2023-12-25 01:46:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:46:35,493 INFO L225 Difference]: With dead ends: 57 [2023-12-25 01:46:35,493 INFO L226 Difference]: Without dead ends: 55 [2023-12-25 01:46:35,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:46:35,494 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:46:35,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2023-12-25 01:46:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-25 01:46:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2023-12-25 01:46:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-25 01:46:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2023-12-25 01:46:35,509 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 50 [2023-12-25 01:46:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:46:35,510 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2023-12-25 01:46:35,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 01:46:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2023-12-25 01:46:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 01:46:35,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:46:35,511 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:46:35,526 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-25 01:46:35,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:46:35,723 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:46:35,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:46:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2047387093, now seen corresponding path program 1 times [2023-12-25 01:46:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:46:35,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100177496] [2023-12-25 01:46:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:46:35,724 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-25 01:46:35,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:46:35,725 INFO L229 MonitoredProcess]: Starting monitored process 7 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-25 01:46:35,726 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 (7)] Waiting until timeout for monitored process [2023-12-25 01:46:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:46:36,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 01:46:36,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:46:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 01:46:41,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:46:57,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:46:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100177496] [2023-12-25 01:46:57,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100177496] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 01:46:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1446866726] [2023-12-25 01:46:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:46:57,433 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 01:46:57,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 01:46:57,469 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 01:46:57,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-25 01:46:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:46:58,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 01:46:58,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:47:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:47:13,122 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:47:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1446866726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:47:13,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:47:13,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-25 01:47:13,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679771651] [2023-12-25 01:47:13,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:47:13,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:47:13,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:47:13,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:47:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:47:13,137 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 01:47:20,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:47:21,115 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2023-12-25 01:47:21,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:47:21,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2023-12-25 01:47:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:47:21,132 INFO L225 Difference]: With dead ends: 61 [2023-12-25 01:47:21,132 INFO L226 Difference]: Without dead ends: 59 [2023-12-25 01:47:21,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-25 01:47:21,133 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:47:21,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-12-25 01:47:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-25 01:47:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-12-25 01:47:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-25 01:47:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-12-25 01:47:21,148 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 55 [2023-12-25 01:47:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:47:21,148 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-12-25 01:47:21,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 01:47:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-12-25 01:47:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 01:47:21,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:47:21,150 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:47:21,166 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 (7)] Forceful destruction successful, exit code 0 [2023-12-25 01:47:21,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:47:21,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 01:47:21,556 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:47:21,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:47:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1705825109, now seen corresponding path program 1 times [2023-12-25 01:47:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:47:21,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507751167] [2023-12-25 01:47:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:47:21,556 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-25 01:47:21,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:47:21,557 INFO L229 MonitoredProcess]: Starting monitored process 9 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-25 01:47:21,559 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 (9)] Waiting until timeout for monitored process [2023-12-25 01:47:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:47:22,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:47:22,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:47:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-25 01:47:24,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:47:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-25 01:47:33,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:47:33,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507751167] [2023-12-25 01:47:33,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507751167] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:47:33,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:47:33,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2023-12-25 01:47:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125283958] [2023-12-25 01:47:33,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:47:33,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 01:47:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:47:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 01:47:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:47:33,028 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 01:47:36,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:47:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:47:37,799 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2023-12-25 01:47:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:47:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2023-12-25 01:47:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:47:37,816 INFO L225 Difference]: With dead ends: 64 [2023-12-25 01:47:37,816 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 01:47:37,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:47:37,817 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:47:37,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-25 01:47:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 01:47:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2023-12-25 01:47:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-25 01:47:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2023-12-25 01:47:37,829 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 62 [2023-12-25 01:47:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:47:37,829 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2023-12-25 01:47:37,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 01:47:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2023-12-25 01:47:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 01:47:37,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:47:37,831 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:47:37,849 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:47:38,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-25 01:47:38,050 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:47:38,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:47:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 392643903, now seen corresponding path program 1 times [2023-12-25 01:47:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:47:38,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742983231] [2023-12-25 01:47:38,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:47:38,051 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-25 01:47:38,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:47:38,052 INFO L229 MonitoredProcess]: Starting monitored process 10 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-25 01:47:38,053 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 (10)] Waiting until timeout for monitored process [2023-12-25 01:47:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:47:38,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 01:47:38,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:47:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 01:47:39,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:47:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-25 01:47:40,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:47:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742983231] [2023-12-25 01:47:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742983231] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:47:40,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:47:40,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-12-25 01:47:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277920790] [2023-12-25 01:47:40,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:47:40,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:47:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:47:40,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:47:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:47:40,370 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-25 01:47:42,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:47:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:47:48,878 INFO L93 Difference]: Finished difference Result 113 states and 160 transitions. [2023-12-25 01:47:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 01:47:48,898 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 64 [2023-12-25 01:47:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:47:48,899 INFO L225 Difference]: With dead ends: 113 [2023-12-25 01:47:48,899 INFO L226 Difference]: Without dead ends: 105 [2023-12-25 01:47:48,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-12-25 01:47:48,901 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 155 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:47:48,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 261 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-12-25 01:47:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-25 01:47:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 69. [2023-12-25 01:47:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-25 01:47:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2023-12-25 01:47:48,923 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 64 [2023-12-25 01:47:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:47:48,924 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2023-12-25 01:47:48,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 9 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-25 01:47:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2023-12-25 01:47:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 01:47:48,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:47:48,925 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:47:48,948 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 (10)] Ended with exit code 0 [2023-12-25 01:47:49,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-25 01:47:49,140 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:47:49,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:47:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash -45785549, now seen corresponding path program 1 times [2023-12-25 01:47:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:47:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652841981] [2023-12-25 01:47:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:47:49,141 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-25 01:47:49,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:47:49,142 INFO L229 MonitoredProcess]: Starting monitored process 11 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-25 01:47:49,144 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 (11)] Waiting until timeout for monitored process [2023-12-25 01:47:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:47:49,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:47:49,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:47:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-25 01:47:51,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:48:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-25 01:48:06,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:48:06,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652841981] [2023-12-25 01:48:06,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652841981] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:48:06,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:48:06,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2023-12-25 01:48:06,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547526007] [2023-12-25 01:48:06,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:48:06,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:48:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:48:06,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:48:06,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:48:06,669 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2023-12-25 01:48:19,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:48:28,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:48:33,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:48:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:48:33,852 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2023-12-25 01:48:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 01:48:33,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 70 [2023-12-25 01:48:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:48:33,879 INFO L225 Difference]: With dead ends: 97 [2023-12-25 01:48:33,879 INFO L226 Difference]: Without dead ends: 94 [2023-12-25 01:48:33,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:48:33,880 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:48:33,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 299 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 225 Invalid, 1 Unknown, 0 Unchecked, 22.4s Time] [2023-12-25 01:48:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-25 01:48:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-12-25 01:48:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-25 01:48:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2023-12-25 01:48:33,906 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 70 [2023-12-25 01:48:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:48:33,907 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2023-12-25 01:48:33,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2023-12-25 01:48:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2023-12-25 01:48:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 01:48:33,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:48:33,908 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:48:33,928 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 01:48:34,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-25 01:48:34,113 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:48:34,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:48:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1519552206, now seen corresponding path program 2 times [2023-12-25 01:48:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:48:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482290829] [2023-12-25 01:48:34,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:48:34,114 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-25 01:48:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:48:34,115 INFO L229 MonitoredProcess]: Starting monitored process 12 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-25 01:48:34,115 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 (12)] Waiting until timeout for monitored process [2023-12-25 01:48:34,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:48:34,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:48:34,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 01:48:34,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:48:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-12-25 01:48:37,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:49:25,966 WARN L293 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:49:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-25 01:49:48,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:49:48,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482290829] [2023-12-25 01:49:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482290829] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:49:48,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:49:48,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2023-12-25 01:49:48,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244349311] [2023-12-25 01:49:48,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:49:48,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 01:49:48,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:49:48,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 01:49:48,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:49:48,082 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2023-12-25 01:49:50,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 01:49:56,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:50:01,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:50:08,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:50:30,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:50:34,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:50:43,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:51:20,732 WARN L293 SmtUtils]: Spent 15.74s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:51:25,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:51:29,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:51:33,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:51:37,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:10,792 WARN L293 SmtUtils]: Spent 10.53s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:52:13,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:16,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:21,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:27,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:30,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:35,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:38,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:42,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:44,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:54,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:52:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:52:56,666 INFO L93 Difference]: Finished difference Result 198 states and 284 transitions. [2023-12-25 01:52:56,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 01:52:56,730 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) Word has length 75 [2023-12-25 01:52:56,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:52:56,732 INFO L225 Difference]: With dead ends: 198 [2023-12-25 01:52:56,732 INFO L226 Difference]: Without dead ends: 195 [2023-12-25 01:52:56,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 134.2s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2023-12-25 01:52:56,734 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 152 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 150 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:52:56,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 278 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 312 Invalid, 8 Unknown, 0 Unchecked, 97.2s Time] [2023-12-25 01:52:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-25 01:52:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2023-12-25 01:52:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 100 states have (on average 1.22) internal successors, (122), 102 states have internal predecessors, (122), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2023-12-25 01:52:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2023-12-25 01:52:56,818 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 75 [2023-12-25 01:52:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:52:56,819 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2023-12-25 01:52:56,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2023-12-25 01:52:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2023-12-25 01:52:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-25 01:52:56,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:52:56,821 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:52:56,853 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 (12)] Ended with exit code 0 [2023-12-25 01:52:57,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-25 01:52:57,045 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:52:57,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:52:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1881497901, now seen corresponding path program 3 times [2023-12-25 01:52:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:52:57,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805723645] [2023-12-25 01:52:57,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:52:57,046 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-25 01:52:57,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:52:57,047 INFO L229 MonitoredProcess]: Starting monitored process 13 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-25 01:52:57,047 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 (13)] Waiting until timeout for monitored process [2023-12-25 01:53:00,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 01:53:00,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:53:00,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 01:53:00,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:53:34,347 WARN L293 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:53:45,030 WARN L293 SmtUtils]: Spent 6.02s 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-25 01:54:25,774 WARN L293 SmtUtils]: Spent 6.15s 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-25 01:54:44,577 WARN L293 SmtUtils]: Spent 11.49s 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-25 01:54:49,890 WARN L293 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:55:05,890 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:55:51,458 WARN L293 SmtUtils]: Spent 5.38s 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-25 01:56:30,545 WARN L293 SmtUtils]: Spent 7.10s 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-25 01:57:20,275 WARN L293 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:58:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 43 proven. 20 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-12-25 01:58:22,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:59:49,751 WARN L293 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 02:00:32,436 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-25 02:00:32,436 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 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:00:33,476 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 (13)] Forceful destruction successful, exit code 0 [2023-12-25 02:00:33,637 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-25 02:00:33,660 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-25 02:00:33,662 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 02:00:33,662 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 81 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-25 02:00:33,665 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:00:33,667 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 02:00:33,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 02:00:33 BoogieIcfgContainer [2023-12-25 02:00:33,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 02:00:33,669 INFO L158 Benchmark]: Toolchain (without parser) took 881086.04ms. Allocated memory was 200.3MB in the beginning and 271.6MB in the end (delta: 71.3MB). Free memory was 152.7MB in the beginning and 214.0MB in the end (delta: -61.2MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2023-12-25 02:00:33,669 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 200.3MB. Free memory was 153.8MB in the beginning and 153.7MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:00:33,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.28ms. Allocated memory is still 200.3MB. Free memory was 152.6MB in the beginning and 140.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 02:00:33,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.47ms. Allocated memory is still 200.3MB. Free memory was 140.5MB in the beginning and 138.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:00:33,670 INFO L158 Benchmark]: Boogie Preprocessor took 31.05ms. Allocated memory is still 200.3MB. Free memory was 138.7MB in the beginning and 136.9MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 02:00:33,670 INFO L158 Benchmark]: RCFGBuilder took 544.55ms. Allocated memory is still 200.3MB. Free memory was 136.9MB in the beginning and 122.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 02:00:33,670 INFO L158 Benchmark]: TraceAbstraction took 880283.37ms. Allocated memory was 200.3MB in the beginning and 271.6MB in the end (delta: 71.3MB). Free memory was 121.9MB in the beginning and 214.0MB in the end (delta: -92.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:00:33,671 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.49ms. Allocated memory is still 200.3MB. Free memory was 153.8MB in the beginning and 153.7MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.28ms. Allocated memory is still 200.3MB. Free memory was 152.6MB in the beginning and 140.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.47ms. Allocated memory is still 200.3MB. Free memory was 140.5MB in the beginning and 138.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.05ms. Allocated memory is still 200.3MB. Free memory was 138.7MB in the beginning and 136.9MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 544.55ms. Allocated memory is still 200.3MB. Free memory was 136.9MB in the beginning and 122.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 880283.37ms. Allocated memory was 200.3MB in the beginning and 271.6MB in the end (delta: 71.3MB). Free memory was 121.9MB in the beginning and 214.0MB in the end (delta: -92.0MB). There was no memory consumed. 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: 13]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13). Cancelled while NwaCegarLoop was analyzing trace of length 81 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 880.2s, OverallIterations: 11, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 260.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 159.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 1687 SdHoareTripleChecker+Invalid, 148.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1328 mSDsCounter, 359 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 933 IncrementalHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 359 mSolverCounterUnsat, 359 mSDtfsCounter, 933 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1060 GetRequests, 921 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 180.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=10, InterpolantAutomatonStates: 89, 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, 10 MinimizatonAttempts, 67 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 157.0s InterpolantComputationTime, 593 NumberOfCodeBlocks, 593 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1019 ConstructedInterpolants, 35 QuantifiedInterpolants, 4747 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1062 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 1348/1598 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