/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/sqrt1-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 05:16:17,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 05:16:17,209 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 05:16:17,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 05:16:17,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 05:16:17,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 05:16:17,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 05:16:17,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 05:16:17,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 05:16:17,230 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 05:16:17,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 05:16:17,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 05:16:17,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 05:16:17,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 05:16:17,232 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 05:16:17,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 05:16:17,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 05:16:17,233 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 05:16:17,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 05:16:17,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 05:16:17,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 05:16:17,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 05:16:17,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 05:16:17,235 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 05:16:17,235 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 05:16:17,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 05:16:17,235 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 05:16:17,235 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 05:16:17,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 05:16:17,236 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 05:16:17,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 05:16:17,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 05:16:17,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 05:16:17,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 05:16:17,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:16:17,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 05:16:17,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 05:16:17,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 05:16:17,237 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 05:16:17,237 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 05:16:17,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 05:16:17,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 05:16:17,238 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 05:16:17,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 05:16:17,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 05:16:17,238 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 05:16:17,238 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 05:16:17,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 05:16:17,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 05:16:17,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 05:16:17,446 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 05:16:17,446 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 05:16:17,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound50.c [2023-12-25 05:16:18,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 05:16:18,639 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 05:16:18,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound50.c [2023-12-25 05:16:18,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073c2571b/68e2fe0f3b544afe87f2eed7b35595a4/FLAG552434227 [2023-12-25 05:16:18,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073c2571b/68e2fe0f3b544afe87f2eed7b35595a4 [2023-12-25 05:16:18,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 05:16:18,658 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 05:16:18,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 05:16:18,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 05:16:18,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 05:16:18,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2428e5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18, skipping insertion in model container [2023-12-25 05:16:18,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,682 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 05:16:18,810 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/sqrt1-ll_valuebound50.c[520,533] [2023-12-25 05:16:18,822 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:16:18,831 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 05:16:18,839 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/sqrt1-ll_valuebound50.c[520,533] [2023-12-25 05:16:18,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:16:18,854 INFO L206 MainTranslator]: Completed translation [2023-12-25 05:16:18,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18 WrapperNode [2023-12-25 05:16:18,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 05:16:18,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 05:16:18,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 05:16:18,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 05:16:18,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,878 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2023-12-25 05:16:18,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 05:16:18,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 05:16:18,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 05:16:18,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 05:16:18,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,896 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 05:16:18,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 05:16:18,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 05:16:18,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 05:16:18,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 05:16:18,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (1/1) ... [2023-12-25 05:16:18,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:16:18,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 05:16:18,966 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 05:16:18,981 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 05:16:18,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 05:16:18,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 05:16:18,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 05:16:18,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 05:16:18,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 05:16:18,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 05:16:19,028 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 05:16:19,029 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 05:16:19,192 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 05:16:19,214 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 05:16:19,214 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 05:16:19,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:16:19 BoogieIcfgContainer [2023-12-25 05:16:19,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 05:16:19,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 05:16:19,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 05:16:19,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 05:16:19,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:16:18" (1/3) ... [2023-12-25 05:16:19,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a082b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:16:19, skipping insertion in model container [2023-12-25 05:16:19,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:16:18" (2/3) ... [2023-12-25 05:16:19,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a082b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:16:19, skipping insertion in model container [2023-12-25 05:16:19,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:16:19" (3/3) ... [2023-12-25 05:16:19,221 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound50.c [2023-12-25 05:16:19,233 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 05:16:19,234 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 05:16:19,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 05:16:19,272 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;@76a4e92f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 05:16:19,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 05:16:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:16:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 05:16:19,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:16:19,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:16:19,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:16:19,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:16:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1841396225, now seen corresponding path program 1 times [2023-12-25 05:16:19,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:16:19,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15162839] [2023-12-25 05:16:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:16:19,292 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 05:16:19,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:16:19,294 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 05:16:19,297 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 05:16:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:16:19,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 05:16:19,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:16:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:16:19,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:16:19,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:16:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15162839] [2023-12-25 05:16:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15162839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:16:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:16:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 05:16:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222662821] [2023-12-25 05:16:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:16:19,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 05:16:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:16:19,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 05:16:19,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 05:16:19,370 INFO L87 Difference]: Start difference. First operand has 19 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:16:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:16:19,388 INFO L93 Difference]: Finished difference Result 36 states and 59 transitions. [2023-12-25 05:16:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 05:16:19,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 05:16:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:16:19,395 INFO L225 Difference]: With dead ends: 36 [2023-12-25 05:16:19,395 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 05:16:19,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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 05:16:19,402 INFO L413 NwaCegarLoop]: 22 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, 22 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 05:16:19,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:16:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 05:16:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 05:16:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 05:16:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-12-25 05:16:19,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 8 [2023-12-25 05:16:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:16:19,429 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-12-25 05:16:19,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:16:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-12-25 05:16:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 05:16:19,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:16:19,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:16:19,431 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 05:16:19,635 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 05:16:19,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:16:19,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:16:19,636 INFO L85 PathProgramCache]: Analyzing trace with hash -676895413, now seen corresponding path program 1 times [2023-12-25 05:16:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:16:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994817995] [2023-12-25 05:16:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:16:19,645 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 05:16:19,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:16:19,650 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 05:16:19,651 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 05:16:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:16:19,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:16:19,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:16:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:16:19,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:16:19,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:16:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994817995] [2023-12-25 05:16:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994817995] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:16:19,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:16:19,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:16:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176393156] [2023-12-25 05:16:19,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:16:19,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:16:19,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:16:19,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:16:19,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:16:19,746 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:16:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:16:19,950 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2023-12-25 05:16:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:16:19,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 05:16:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:16:19,951 INFO L225 Difference]: With dead ends: 31 [2023-12-25 05:16:19,951 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 05:16:19,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:16:19,953 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:16:19,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 59 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 05:16:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 05:16:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-25 05:16:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 05:16:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-25 05:16:19,973 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 8 [2023-12-25 05:16:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:16:19,973 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-25 05:16:19,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:16:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-25 05:16:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-25 05:16:19,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:16:19,974 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:16:19,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 05:16:20,175 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 05:16:20,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:16:20,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:16:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash -973316325, now seen corresponding path program 1 times [2023-12-25 05:16:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:16:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883178736] [2023-12-25 05:16:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:16:20,178 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 05:16:20,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:16:20,180 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 05:16:20,181 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 05:16:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:16:20,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:16:20,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:16:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:16:20,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:16:20,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:16:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883178736] [2023-12-25 05:16:20,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883178736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:16:20,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:16:20,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:16:20,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001307713] [2023-12-25 05:16:20,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:16:20,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:16:20,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:16:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:16:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:16:20,306 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 05:16:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:16:20,847 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-12-25 05:16:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:16:20,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-25 05:16:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:16:20,855 INFO L225 Difference]: With dead ends: 35 [2023-12-25 05:16:20,855 INFO L226 Difference]: Without dead ends: 33 [2023-12-25 05:16:20,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:16:20,856 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:16:20,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 61 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 05:16:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-25 05:16:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-12-25 05:16:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 05:16:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 05:16:20,864 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 13 [2023-12-25 05:16:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:16:20,864 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 05:16:20,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 05:16:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 05:16:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 05:16:20,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:16:20,865 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:16:20,879 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 05:16:21,069 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 05:16:21,070 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:16:21,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:16:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash -169337077, now seen corresponding path program 1 times [2023-12-25 05:16:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:16:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861477932] [2023-12-25 05:16:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:16:21,071 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 05:16:21,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:16:21,076 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 05:16:21,078 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 05:16:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:16:21,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:16:21,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:16:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 05:16:21,221 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:16:21,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:16:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861477932] [2023-12-25 05:16:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861477932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:16:21,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:16:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:16:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339765928] [2023-12-25 05:16:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:16:21,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:16:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:16:21,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:16:21,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:16:21,227 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:16:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:16:21,665 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-12-25 05:16:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:16:21,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 05:16:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:16:21,672 INFO L225 Difference]: With dead ends: 39 [2023-12-25 05:16:21,672 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 05:16:21,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:16:21,673 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 05:16:21,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 05:16:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 05:16:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-25 05:16:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 05:16:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-12-25 05:16:21,680 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2023-12-25 05:16:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:16:21,680 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-12-25 05:16:21,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:16:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-12-25 05:16:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 05:16:21,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:16:21,681 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:16:21,686 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 05:16:21,881 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 05:16:21,882 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:16:21,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:16:21,882 INFO L85 PathProgramCache]: Analyzing trace with hash -569620647, now seen corresponding path program 1 times [2023-12-25 05:16:21,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:16:21,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778494595] [2023-12-25 05:16:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:16:21,883 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 05:16:21,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:16:21,888 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 05:16:21,890 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 05:16:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:16:21,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 05:16:21,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:16:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 05:16:22,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:16:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 05:16:22,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:16:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778494595] [2023-12-25 05:16:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778494595] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 05:16:22,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 05:16:22,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 05:16:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177310933] [2023-12-25 05:16:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:16:22,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:16:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:16:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:16:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 05:16:22,187 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:16:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:16:22,409 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-12-25 05:16:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:16:22,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-12-25 05:16:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:16:22,416 INFO L225 Difference]: With dead ends: 40 [2023-12-25 05:16:22,416 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 05:16:22,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:16:22,417 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:16:22,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 05:16:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 05:16:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-25 05:16:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 05:16:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-12-25 05:16:22,425 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2023-12-25 05:16:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:16:22,425 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-12-25 05:16:22,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:16:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-12-25 05:16:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 05:16:22,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:16:22,426 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:16:22,436 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 05:16:22,626 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 05:16:22,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:16:22,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:16:22,627 INFO L85 PathProgramCache]: Analyzing trace with hash -583494195, now seen corresponding path program 2 times [2023-12-25 05:16:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:16:22,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075553437] [2023-12-25 05:16:22,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:16:22,628 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 05:16:22,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:16:22,629 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 05:16:22,629 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 05:16:22,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 05:16:22,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:16:22,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 05:16:22,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:16:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 05:16:22,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:16:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 05:16:26,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:16:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075553437] [2023-12-25 05:16:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075553437] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:16:26,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:16:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 05:16:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248438456] [2023-12-25 05:16:26,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:16:26,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 05:16:26,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:16:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 05:16:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:16:26,115 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 05:16:32,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:36,040 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 05:16:40,214 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 05:16:44,218 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 05:16:48,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:52,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:56,468 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 05:17:01,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:05,426 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 05:17:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:17:06,961 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2023-12-25 05:17:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 05:17:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 30 [2023-12-25 05:17:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:17:06,970 INFO L225 Difference]: With dead ends: 72 [2023-12-25 05:17:06,970 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 05:17:06,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-25 05:17:06,971 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 40 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.8s IncrementalHoareTripleChecker+Time [2023-12-25 05:17:06,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 74 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 79 Invalid, 9 Unknown, 0 Unchecked, 39.8s Time] [2023-12-25 05:17:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 05:17:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2023-12-25 05:17:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 37 states have internal predecessors, (39), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 05:17:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2023-12-25 05:17:06,985 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 30 [2023-12-25 05:17:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:17:06,985 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2023-12-25 05:17:06,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 05:17:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2023-12-25 05:17:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 05:17:06,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:17:06,986 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-12-25 05:17:06,992 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 05:17:07,191 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 [2023-12-25 05:17:07,192 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:17:07,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:17:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash 682134731, now seen corresponding path program 3 times [2023-12-25 05:17:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:17:07,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076071659] [2023-12-25 05:17:07,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 05:17:07,193 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 05:17:07,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:17:07,194 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:17:07,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 05:17:07,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 05:17:07,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:17:07,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 05:17:07,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:17:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-25 05:17:08,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:17:35,306 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvadd (bvmul |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_~t~0#1|) (_ bv1 64) (bvneg (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv8 64)) (bvmul (_ bv4 64) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|)) (_ bv4 64))) (bvmul |c_ULTIMATE.start_main_~t~0#1| (_ bv2 64)))) (not (= |c_ULTIMATE.start_main_~t~0#1| (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 64)) (_ bv1 64)))))) is different from true [2023-12-25 05:17:35,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:17:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076071659] [2023-12-25 05:17:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076071659] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 05:17:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1295854489] [2023-12-25 05:17:35,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 05:17:35,307 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 05:17:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 05:17:35,309 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 05:17:35,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-25 05:17:35,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 05:17:35,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:17:35,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 05:17:35,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:17:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 05:17:36,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:17:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2023-12-25 05:17:41,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1295854489] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 05:17:41,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:17:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 7] total 16 [2023-12-25 05:17:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291578372] [2023-12-25 05:17:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:17:41,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:17:41,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:17:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:17:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2023-12-25 05:17:41,679 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:17:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:17:43,703 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2023-12-25 05:17:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:17:43,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2023-12-25 05:17:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:17:43,705 INFO L225 Difference]: With dead ends: 73 [2023-12-25 05:17:43,705 INFO L226 Difference]: Without dead ends: 68 [2023-12-25 05:17:43,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2023-12-25 05:17:43,705 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 05:17:43,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 05:17:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-25 05:17:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-12-25 05:17:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 05:17:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-12-25 05:17:43,718 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 52 [2023-12-25 05:17:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:17:43,718 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-12-25 05:17:43,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:17:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-12-25 05:17:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 05:17:43,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:17:43,719 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2023-12-25 05:17:43,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-12-25 05:17:43,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 05:17:44,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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 05:17:44,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:17:44,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:17:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash -462306405, now seen corresponding path program 4 times [2023-12-25 05:17:44,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:17:44,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036688179] [2023-12-25 05:17:44,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 05:17:44,130 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 05:17:44,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:17:44,135 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 05:17:44,136 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 05:17:44,425 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 05:17:44,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:17:44,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 05:17:44,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:17:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 26 proven. 42 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-25 05:17:44,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:17:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 26 proven. 42 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-25 05:17:57,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:17:57,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036688179] [2023-12-25 05:17:57,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036688179] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:17:57,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:17:57,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-25 05:17:57,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219831450] [2023-12-25 05:17:57,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:17:57,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 05:17:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:17:57,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 05:17:57,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-25 05:17:57,507 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 10 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2023-12-25 05:18:21,762 WARN L293 SmtUtils]: Spent 20.38s 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 05:18:25,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:29,816 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 05:18:34,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:38,084 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 05:18:42,470 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 05:19:08,252 WARN L293 SmtUtils]: Spent 16.46s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:19:12,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:16,297 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 05:19:20,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:24,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:28,401 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 05:19:32,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:36,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:40,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:44,770 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 05:19:48,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:52,936 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 05:19:56,994 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 05:20:01,006 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 05:20:27,089 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:20:31,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:20:35,129 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 05:20:39,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:20:43,181 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 05:20:47,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:20:51,238 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 05:20:55,285 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 05:20:59,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:21:03,342 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 05:21:07,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:21:11,474 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 05:21:15,537 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 05:21:19,540 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 05:21:23,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:21:27,636 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 05:21:31,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:21:35,698 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 05:21:39,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:21:43,762 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 05:21:47,775 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 05:22:16,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:22:20,946 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 05:22:24,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:22:28,992 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 05:22:32,996 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 05:22:37,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:22:41,040 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 05:22:45,090 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 05:22:49,094 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 05:22:53,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:22:57,144 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 05:23:01,150 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 05:23:05,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:23:09,284 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 05:23:13,289 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 05:23:17,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:23:21,366 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 05:23:25,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:23:29,467 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 05:23:33,471 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 05:23:37,528 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 05:23:41,534 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 05:23:45,539 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 05:23:49,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:23:53,600 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 05:23:57,613 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 05:24:01,628 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 05:24:05,691 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 05:24:09,694 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 05:24:13,914 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 05:24:17,919 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 05:24:21,923 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 05:24:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:24:24,112 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2023-12-25 05:24:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 05:24:24,120 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 10 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 81 [2023-12-25 05:24:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:24:24,121 INFO L225 Difference]: With dead ends: 124 [2023-12-25 05:24:24,121 INFO L226 Difference]: Without dead ends: 110 [2023-12-25 05:24:24,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 107.6s TimeCoverageRelationStatistics Valid=114, Invalid=336, Unknown=12, NotChecked=0, Total=462 [2023-12-25 05:24:24,122 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 78 mSolverCounterUnsat, 70 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 286.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 70 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 287.4s IncrementalHoareTripleChecker+Time [2023-12-25 05:24:24,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 223 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 241 Invalid, 70 Unknown, 0 Unchecked, 287.4s Time] [2023-12-25 05:24:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-25 05:24:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-12-25 05:24:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 62 states have (on average 1.032258064516129) internal successors, (64), 63 states have internal predecessors, (64), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 05:24:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2023-12-25 05:24:24,146 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 81 [2023-12-25 05:24:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:24:24,146 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2023-12-25 05:24:24,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 10 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2023-12-25 05:24:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2023-12-25 05:24:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-25 05:24:24,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:24:24,148 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 31, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2023-12-25 05:24:24,163 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 05:24:24,363 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 05:24:24,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:24:24,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:24:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1635999141, now seen corresponding path program 5 times [2023-12-25 05:24:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:24:24,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927376879] [2023-12-25 05:24:24,364 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 05:24:24,365 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 05:24:24,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:24:24,366 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 05:24:24,367 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 05:24:28,653 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2023-12-25 05:24:28,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:24:28,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-25 05:24:28,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:24:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 935 proven. 449 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2023-12-25 05:24:30,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:25:11,844 WARN L293 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:26:27,219 WARN L293 SmtUtils]: Spent 12.44s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:27:19,557 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:28:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 289 proven. 269 refuted. 0 times theorem prover too weak. 1619 trivial. 0 not checked. [2023-12-25 05:28:18,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:28:18,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927376879] [2023-12-25 05:28:18,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927376879] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:28:18,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:28:18,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 33 [2023-12-25 05:28:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475560847] [2023-12-25 05:28:18,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:28:18,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 05:28:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:28:18,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 05:28:18,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=878, Unknown=5, NotChecked=0, Total=1056 [2023-12-25 05:28:18,482 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 33 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 25 states have internal predecessors, (53), 23 states have call successors, (54), 2 states have call predecessors, (54), 3 states have return successors, (54), 22 states have call predecessors, (54), 23 states have call successors, (54) [2023-12-25 05:28:57,551 WARN L293 SmtUtils]: Spent 23.52s on a formula simplification. DAG size of input: 107 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:29:01,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:29:05,755 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 05:30:33,728 WARN L293 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 112 DAG size of output: 104 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:30:35,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:30:39,423 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 05:30:41,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:30:45,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:30:49,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:30:53,393 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 05:30:57,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:30:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:30:57,281 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2023-12-25 05:30:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 05:30:57,316 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 25 states have internal predecessors, (53), 23 states have call successors, (54), 2 states have call predecessors, (54), 3 states have return successors, (54), 22 states have call predecessors, (54), 23 states have call successors, (54) Word has length 183 [2023-12-25 05:30:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:30:57,317 INFO L225 Difference]: With dead ends: 128 [2023-12-25 05:30:57,317 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 05:30:57,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 235.8s TimeCoverageRelationStatistics Valid=224, Invalid=1101, Unknown=7, NotChecked=0, Total=1332 [2023-12-25 05:30:57,318 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:30:57,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 477 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 539 Invalid, 3 Unknown, 0 Unchecked, 42.1s Time] [2023-12-25 05:30:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 05:30:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 05:30:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:30:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 05:30:57,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2023-12-25 05:30:57,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:30:57,319 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 05:30:57,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 25 states have internal predecessors, (53), 23 states have call successors, (54), 2 states have call predecessors, (54), 3 states have return successors, (54), 22 states have call predecessors, (54), 23 states have call successors, (54) [2023-12-25 05:30:57,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 05:30:57,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 05:30:57,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:30:57,358 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 05:30:57,535 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 05:30:57,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. Received shutdown request... [2023-12-25 05:31:04,199 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 05:31:05,069 WARN L235 SmtUtils]: Removed 21 from assertion stack [2023-12-25 05:31:05,069 WARN L619 AbstractCegarLoop]: Verification canceled: while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 7386ms.. [2023-12-25 05:31:05,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 05:31:05,071 INFO L257 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2023-12-25 05:31:05,072 INFO L158 Benchmark]: Toolchain (without parser) took 886413.80ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 186.1MB in the beginning and 220.5MB in the end (delta: -34.4MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2023-12-25 05:31:05,072 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 199.2MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:31:05,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.11ms. Allocated memory is still 239.1MB. Free memory was 185.6MB in the beginning and 174.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:31:05,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.01ms. Allocated memory is still 239.1MB. Free memory was 174.1MB in the beginning and 172.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:31:05,073 INFO L158 Benchmark]: Boogie Preprocessor took 26.06ms. Allocated memory is still 239.1MB. Free memory was 172.5MB in the beginning and 170.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 05:31:05,073 INFO L158 Benchmark]: RCFGBuilder took 308.76ms. Allocated memory is still 239.1MB. Free memory was 170.9MB in the beginning and 157.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 05:31:05,073 INFO L158 Benchmark]: TraceAbstraction took 885855.38ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 157.3MB in the beginning and 220.5MB in the end (delta: -63.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:31:05,077 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 199.2MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.11ms. Allocated memory is still 239.1MB. Free memory was 185.6MB in the beginning and 174.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.01ms. Allocated memory is still 239.1MB. Free memory was 174.1MB in the beginning and 172.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.06ms. Allocated memory is still 239.1MB. Free memory was 172.5MB in the beginning and 170.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 308.76ms. Allocated memory is still 239.1MB. Free memory was 170.9MB in the beginning and 157.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 885855.38ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 157.3MB in the beginning and 220.5MB in the end (delta: -63.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown