/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/hard-u_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:32:21,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:32:21,810 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 03:32:21,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:32:21,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:32:21,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:32:21,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:32:21,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:32:21,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:32:21,846 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:32:21,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:32:21,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:32:21,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:32:21,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:32:21,848 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:32:21,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:32:21,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:32:21,849 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:32:21,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:32:21,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:32:21,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:32:21,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:32:21,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:32:21,850 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:32:21,850 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:32:21,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:32:21,850 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:32:21,850 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:32:21,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:32:21,850 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:32:21,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:32:21,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:32:21,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:32:21,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:32:21,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:32:21,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:32:21,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:32:21,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:32:21,852 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:32:21,852 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:32:21,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:32:21,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:32:21,853 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:32:21,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:32:21,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:32:21,853 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:32:21,854 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 03:32:22,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:32:22,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:32:22,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:32:22,087 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:32:22,092 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:32:22,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c [2023-12-25 03:32:23,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:32:23,286 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:32:23,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c [2023-12-25 03:32:23,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc4ed2756/7ecab34a9b204426a1ec1da230c383d3/FLAG767ce66ea [2023-12-25 03:32:23,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc4ed2756/7ecab34a9b204426a1ec1da230c383d3 [2023-12-25 03:32:23,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:32:23,311 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:32:23,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:32:23,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:32:23,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:32:23,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@412b790e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23, skipping insertion in model container [2023-12-25 03:32:23,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,333 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:32:23,464 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/hard-u_valuebound50.c[537,550] [2023-12-25 03:32:23,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:32:23,496 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:32:23,508 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/hard-u_valuebound50.c[537,550] [2023-12-25 03:32:23,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:32:23,526 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:32:23,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23 WrapperNode [2023-12-25 03:32:23,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:32:23,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:32:23,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:32:23,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:32:23,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,554 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-12-25 03:32:23,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:32:23,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:32:23,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:32:23,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:32:23,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,572 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 03:32:23,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:32:23,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:32:23,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:32:23,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:32:23,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (1/1) ... [2023-12-25 03:32:23,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:32:23,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:32:23,619 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 03:32:23,621 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 03:32:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:32:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:32:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 03:32:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 03:32:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:32:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:32:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:32:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:32:23,687 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:32:23,688 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:32:23,887 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:32:23,913 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:32:23,913 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 03:32:23,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:32:23 BoogieIcfgContainer [2023-12-25 03:32:23,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:32:23,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:32:23,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:32:23,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:32:23,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:32:23" (1/3) ... [2023-12-25 03:32:23,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb22052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:32:23, skipping insertion in model container [2023-12-25 03:32:23,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:32:23" (2/3) ... [2023-12-25 03:32:23,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb22052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:32:23, skipping insertion in model container [2023-12-25 03:32:23,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:32:23" (3/3) ... [2023-12-25 03:32:23,922 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound50.c [2023-12-25 03:32:23,937 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:32:23,938 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:32:23,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:32:23,988 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;@20db47aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:32:23,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:32:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 03:32:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 03:32:23,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:24,000 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:24,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:24,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2023-12-25 03:32:24,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356327414] [2023-12-25 03:32:24,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:24,020 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 03:32:24,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:24,023 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 03:32:24,100 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 03:32:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:24,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:32:24,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 03:32:24,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:32:24,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:24,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356327414] [2023-12-25 03:32:24,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356327414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:32:24,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:32:24,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:32:24,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765174444] [2023-12-25 03:32:24,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:32:24,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:32:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:32:24,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:32:24,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:32:24,201 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 03:32:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:32:24,234 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2023-12-25 03:32:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:32:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 03:32:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:32:24,241 INFO L225 Difference]: With dead ends: 58 [2023-12-25 03:32:24,242 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 03:32:24,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 03:32:24,252 INFO L413 NwaCegarLoop]: 38 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, 38 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 03:32:24,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:32:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 03:32:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-25 03:32:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:32:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-25 03:32:24,305 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2023-12-25 03:32:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:32:24,308 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-25 03:32:24,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 03:32:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-25 03:32:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 03:32:24,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:24,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:24,312 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 03:32:24,512 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 03:32:24,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:24,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2023-12-25 03:32:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384411484] [2023-12-25 03:32:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:24,514 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 03:32:24,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:24,515 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 03:32:24,516 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 03:32:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:24,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:32:24,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:32:24,629 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:32:24,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:24,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384411484] [2023-12-25 03:32:24,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384411484] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:32:24,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:32:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:32:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221932025] [2023-12-25 03:32:24,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:32:24,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:32:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:32:24,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:32:24,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:32:24,631 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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 03:32:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:32:24,726 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2023-12-25 03:32:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:32:24,728 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), 2 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 23 [2023-12-25 03:32:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:32:24,728 INFO L225 Difference]: With dead ends: 41 [2023-12-25 03:32:24,728 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 03:32:24,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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 03:32:24,730 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:32:24,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:32:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 03:32:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-25 03:32:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:32:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 03:32:24,743 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2023-12-25 03:32:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:32:24,744 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 03:32:24,744 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), 2 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 03:32:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 03:32:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 03:32:24,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:24,745 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:24,750 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 03:32:24,945 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 03:32:24,946 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:24,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2023-12-25 03:32:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:24,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795552399] [2023-12-25 03:32:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:24,947 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 03:32:24,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:24,948 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 03:32:24,951 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 03:32:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:24,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:32:24,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:32:25,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:32:25,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:25,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795552399] [2023-12-25 03:32:25,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795552399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:32:25,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:32:25,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:32:25,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391724102] [2023-12-25 03:32:25,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:32:25,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:32:25,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:32:25,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:32:25,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:32:25,031 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 03:32:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:32:25,170 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-25 03:32:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:32:25,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-25 03:32:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:32:25,171 INFO L225 Difference]: With dead ends: 45 [2023-12-25 03:32:25,171 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 03:32:25,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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 03:32:25,172 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:32:25,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:32:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 03:32:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2023-12-25 03:32:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:32:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2023-12-25 03:32:25,179 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2023-12-25 03:32:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:32:25,179 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-12-25 03:32:25,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 03:32:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2023-12-25 03:32:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 03:32:25,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:25,180 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:25,183 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 03:32:25,382 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 03:32:25,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:25,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2023-12-25 03:32:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950716252] [2023-12-25 03:32:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:25,384 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 03:32:25,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:25,388 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 03:32:25,389 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 03:32:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:25,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 03:32:25,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:25,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 03:32:25,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:32:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 03:32:25,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:25,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950716252] [2023-12-25 03:32:25,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950716252] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:32:25,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:32:25,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-25 03:32:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443781004] [2023-12-25 03:32:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:32:25,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:32:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:32:25,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:32:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:32:25,924 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:32:30,082 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 03:32:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:32:30,296 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2023-12-25 03:32:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:32:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2023-12-25 03:32:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:32:30,298 INFO L225 Difference]: With dead ends: 53 [2023-12-25 03:32:30,298 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 03:32:30,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 03:32:30,299 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:32:30,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-12-25 03:32:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 03:32:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2023-12-25 03:32:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 03:32:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-12-25 03:32:30,306 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 33 [2023-12-25 03:32:30,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:32:30,307 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-12-25 03:32:30,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:32:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-12-25 03:32:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 03:32:30,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:30,308 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:30,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 03:32:30,510 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 03:32:30,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:30,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2023-12-25 03:32:30,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:30,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85882542] [2023-12-25 03:32:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:30,511 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 03:32:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:30,512 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 03:32:30,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 03:32:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:30,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 03:32:30,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 03:32:30,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:32:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 03:32:31,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:31,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85882542] [2023-12-25 03:32:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85882542] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:32:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:32:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 03:32:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873233409] [2023-12-25 03:32:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:32:31,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:32:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:32:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:32:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 03:32:31,205 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 03:32:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:32:31,592 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2023-12-25 03:32:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:32:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2023-12-25 03:32:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:32:31,596 INFO L225 Difference]: With dead ends: 61 [2023-12-25 03:32:31,596 INFO L226 Difference]: Without dead ends: 59 [2023-12-25 03:32:31,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 03:32:31,597 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:32:31,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 03:32:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-25 03:32:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2023-12-25 03:32:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 03:32:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2023-12-25 03:32:31,606 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 40 [2023-12-25 03:32:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:32:31,606 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2023-12-25 03:32:31,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 03:32:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2023-12-25 03:32:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 03:32:31,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:31,607 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:31,613 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 03:32:31,811 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 03:32:31,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:31,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2023-12-25 03:32:31,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:31,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816654575] [2023-12-25 03:32:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:31,812 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 03:32:31,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:31,816 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 03:32:31,818 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 03:32:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:31,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 03:32:31,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-25 03:32:32,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:32:32,815 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-25 03:32:32,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:32,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816654575] [2023-12-25 03:32:32,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816654575] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:32:32,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:32:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-12-25 03:32:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777219295] [2023-12-25 03:32:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:32:32,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 03:32:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:32:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 03:32:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-25 03:32:32,817 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:32:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:32:33,248 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2023-12-25 03:32:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:32:33,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2023-12-25 03:32:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:32:33,250 INFO L225 Difference]: With dead ends: 69 [2023-12-25 03:32:33,250 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 03:32:33,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 03:32:33,250 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 03:32:33,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 03:32:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 03:32:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2023-12-25 03:32:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-25 03:32:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2023-12-25 03:32:33,259 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 50 [2023-12-25 03:32:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:32:33,259 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2023-12-25 03:32:33,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:32:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2023-12-25 03:32:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 03:32:33,260 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:33,260 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:33,273 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 (7)] Ended with exit code 0 [2023-12-25 03:32:33,467 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 03:32:33,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:33,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:33,469 INFO L85 PathProgramCache]: Analyzing trace with hash 769340106, now seen corresponding path program 1 times [2023-12-25 03:32:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:33,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553810403] [2023-12-25 03:32:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:33,469 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 03:32:33,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:33,481 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 03:32:33,482 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 03:32:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:33,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 03:32:33,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-25 03:32:33,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:32:33,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:33,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553810403] [2023-12-25 03:32:33,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553810403] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:32:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [32980589] [2023-12-25 03:32:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:33,920 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:32:33,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:32:33,961 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 03:32:33,963 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 03:32:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:34,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 03:32:34,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:32:34,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:32:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:32:35,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [32980589] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:32:35,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 03:32:35,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2023-12-25 03:32:35,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332404851] [2023-12-25 03:32:35,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 03:32:35,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 03:32:35,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:32:35,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 03:32:35,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-25 03:32:35,161 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-25 03:32:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:32:36,165 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2023-12-25 03:32:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 03:32:36,165 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 51 [2023-12-25 03:32:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:32:36,166 INFO L225 Difference]: With dead ends: 71 [2023-12-25 03:32:36,166 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 03:32:36,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-12-25 03:32:36,167 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 03:32:36,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 123 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 03:32:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 03:32:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2023-12-25 03:32:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 03:32:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2023-12-25 03:32:36,181 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 51 [2023-12-25 03:32:36,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:32:36,181 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2023-12-25 03:32:36,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-25 03:32:36,182 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2023-12-25 03:32:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 03:32:36,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:36,185 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:36,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-25 03:32:36,393 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 (8)] Ended with exit code 0 [2023-12-25 03:32:36,587 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 03:32:36,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:36,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:36,589 INFO L85 PathProgramCache]: Analyzing trace with hash 974239142, now seen corresponding path program 1 times [2023-12-25 03:32:36,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:36,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508818654] [2023-12-25 03:32:36,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:36,589 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 03:32:36,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:36,597 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 03:32:36,598 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 03:32:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:36,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 03:32:36,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-25 03:32:36,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:32:36,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508818654] [2023-12-25 03:32:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508818654] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:32:36,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:32:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 03:32:36,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709001637] [2023-12-25 03:32:36,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:32:36,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 03:32:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:32:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 03:32:36,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:32:36,689 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 03:32:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:32:36,713 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2023-12-25 03:32:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 03:32:36,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2023-12-25 03:32:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:32:36,717 INFO L225 Difference]: With dead ends: 93 [2023-12-25 03:32:36,717 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 03:32:36,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:32:36,718 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:32:36,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:32:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 03:32:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-25 03:32:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-25 03:32:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2023-12-25 03:32:36,736 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 53 [2023-12-25 03:32:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:32:36,736 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-12-25 03:32:36,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 03:32:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2023-12-25 03:32:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 03:32:36,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:36,737 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:36,741 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 03:32:36,939 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 03:32:36,939 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:36,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:36,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2023-12-25 03:32:36,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:36,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471686399] [2023-12-25 03:32:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:36,940 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 03:32:36,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:36,941 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 03:32:36,943 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 03:32:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:37,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 03:32:37,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 03:32:37,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:32:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 03:32:43,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:43,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471686399] [2023-12-25 03:32:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471686399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:32:43,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:32:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2023-12-25 03:32:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225743895] [2023-12-25 03:32:43,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:32:43,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 03:32:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:32:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 03:32:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-12-25 03:32:43,092 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 11 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 10 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-25 03:32:50,915 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 03:32:59,062 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 03:33:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:33:01,560 INFO L93 Difference]: Finished difference Result 158 states and 216 transitions. [2023-12-25 03:33:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 03:33:01,565 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 11 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 10 states have call predecessors, (22), 9 states have call successors, (22) Word has length 70 [2023-12-25 03:33:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:33:01,566 INFO L225 Difference]: With dead ends: 158 [2023-12-25 03:33:01,566 INFO L226 Difference]: Without dead ends: 131 [2023-12-25 03:33:01,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2023-12-25 03:33:01,567 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 77 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 98 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-12-25 03:33:01,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 354 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 365 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2023-12-25 03:33:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-25 03:33:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2023-12-25 03:33:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-25 03:33:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2023-12-25 03:33:01,587 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 70 [2023-12-25 03:33:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:33:01,588 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2023-12-25 03:33:01,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 11 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 10 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-25 03:33:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2023-12-25 03:33:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 03:33:01,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:33:01,607 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:33:01,614 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 03:33:01,811 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 03:33:01,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:33:01,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:33:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash 618643428, now seen corresponding path program 2 times [2023-12-25 03:33:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:33:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030341420] [2023-12-25 03:33:01,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:33:01,812 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 03:33:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:33:01,814 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:33:01,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 03:33:01,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:33:01,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:33:01,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 03:33:01,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:33:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-25 03:33:02,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:33:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-25 03:33:03,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:33:03,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030341420] [2023-12-25 03:33:03,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030341420] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:33:03,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:33:03,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2023-12-25 03:33:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924587995] [2023-12-25 03:33:03,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:33:03,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 03:33:03,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:33:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 03:33:03,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-12-25 03:33:03,587 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2023-12-25 03:33:08,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:33:12,897 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 03:33:21,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:33:31,067 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 03:33:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:33:31,754 INFO L93 Difference]: Finished difference Result 163 states and 216 transitions. [2023-12-25 03:33:31,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 03:33:31,755 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) Word has length 75 [2023-12-25 03:33:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:33:31,756 INFO L225 Difference]: With dead ends: 163 [2023-12-25 03:33:31,756 INFO L226 Difference]: Without dead ends: 137 [2023-12-25 03:33:31,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=93, Invalid=411, Unknown=2, NotChecked=0, Total=506 [2023-12-25 03:33:31,758 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 51 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 45 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-12-25 03:33:31,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 321 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 263 Invalid, 4 Unknown, 0 Unchecked, 18.5s Time] [2023-12-25 03:33:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-25 03:33:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2023-12-25 03:33:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 84 states have internal predecessors, (92), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-25 03:33:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 174 transitions. [2023-12-25 03:33:31,803 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 174 transitions. Word has length 75 [2023-12-25 03:33:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:33:31,804 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 174 transitions. [2023-12-25 03:33:31,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2023-12-25 03:33:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2023-12-25 03:33:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 03:33:31,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:33:31,808 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:33:31,815 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 (12)] Forceful destruction successful, exit code 0 [2023-12-25 03:33:32,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:33:32,013 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:33:32,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:33:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times [2023-12-25 03:33:32,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:33:32,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762075140] [2023-12-25 03:33:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:33:32,014 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 03:33:32,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:33:32,015 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:33:32,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 03:33:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:33:32,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:33:32,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:33:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 65 proven. 27 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-25 03:33:32,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:33:35,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:33:35,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762075140] [2023-12-25 03:33:35,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762075140] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:33:35,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1435756382] [2023-12-25 03:33:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:33:35,101 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:33:35,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:33:35,102 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:33:35,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-25 03:33:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:33:35,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 03:33:35,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:33:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 65 proven. 27 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-25 03:33:35,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:34:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 65 proven. 27 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-25 03:34:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1435756382] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:34:09,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 03:34:09,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 25 [2023-12-25 03:34:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993413459] [2023-12-25 03:34:09,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 03:34:09,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 03:34:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 03:34:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=537, Unknown=3, NotChecked=0, Total=650 [2023-12-25 03:34:09,436 INFO L87 Difference]: Start difference. First operand 136 states and 174 transitions. Second operand has 25 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 20 states have internal predecessors, (47), 15 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 15 states have call predecessors, (33), 13 states have call successors, (33) [2023-12-25 03:34:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:24,336 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2023-12-25 03:34:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 03:34:24,343 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 20 states have internal predecessors, (47), 15 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 15 states have call predecessors, (33), 13 states have call successors, (33) Word has length 81 [2023-12-25 03:34:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:24,344 INFO L225 Difference]: With dead ends: 162 [2023-12-25 03:34:24,344 INFO L226 Difference]: Without dead ends: 142 [2023-12-25 03:34:24,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=239, Invalid=1090, Unknown=3, NotChecked=0, Total=1332 [2023-12-25 03:34:24,345 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:24,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 340 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-25 03:34:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-25 03:34:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2023-12-25 03:34:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 80 states have (on average 1.15) internal successors, (92), 85 states have internal predecessors, (92), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-25 03:34:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions. [2023-12-25 03:34:24,372 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 81 [2023-12-25 03:34:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:24,372 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions. [2023-12-25 03:34:24,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 20 states have internal predecessors, (47), 15 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 15 states have call predecessors, (33), 13 states have call successors, (33) [2023-12-25 03:34:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions. [2023-12-25 03:34:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 03:34:24,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:24,373 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:24,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2023-12-25 03:34:24,581 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 (13)] Ended with exit code 0 [2023-12-25 03:34:24,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /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 03:34:24,781 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:24,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:24,781 INFO L85 PathProgramCache]: Analyzing trace with hash 934948080, now seen corresponding path program 2 times [2023-12-25 03:34:24,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:24,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808771175] [2023-12-25 03:34:24,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:34:24,781 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 03:34:24,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:24,782 INFO L229 MonitoredProcess]: Starting monitored process 15 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 03:34:24,791 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 (15)] Waiting until timeout for monitored process [2023-12-25 03:34:24,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:34:24,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:34:24,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 03:34:24,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2023-12-25 03:34:24,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:34:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2023-12-25 03:34:25,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:25,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808771175] [2023-12-25 03:34:25,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808771175] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:34:25,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:34:25,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 03:34:25,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247406616] [2023-12-25 03:34:25,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:34:25,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 03:34:25,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:25,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 03:34:25,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-25 03:34:25,030 INFO L87 Difference]: Start difference. First operand 135 states and 166 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 8 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2023-12-25 03:34:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:34:25,393 INFO L93 Difference]: Finished difference Result 205 states and 271 transitions. [2023-12-25 03:34:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 03:34:25,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 8 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 98 [2023-12-25 03:34:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:34:25,395 INFO L225 Difference]: With dead ends: 205 [2023-12-25 03:34:25,395 INFO L226 Difference]: Without dead ends: 168 [2023-12-25 03:34:25,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-25 03:34:25,396 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:34:25,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 138 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 03:34:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-25 03:34:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2023-12-25 03:34:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 98 states have (on average 1.153061224489796) internal successors, (113), 102 states have internal predecessors, (113), 50 states have call successors, (50), 16 states have call predecessors, (50), 16 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-25 03:34:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2023-12-25 03:34:25,452 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 98 [2023-12-25 03:34:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:34:25,452 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2023-12-25 03:34:25,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 8 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2023-12-25 03:34:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2023-12-25 03:34:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 03:34:25,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:34:25,453 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:34:25,457 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 03:34:25,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 03:34:25,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:34:25,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:34:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1209712204, now seen corresponding path program 3 times [2023-12-25 03:34:25,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:34:25,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064114105] [2023-12-25 03:34:25,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:34:25,659 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 03:34:25,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:34:25,660 INFO L229 MonitoredProcess]: Starting monitored process 16 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 03:34:25,661 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 (16)] Waiting until timeout for monitored process [2023-12-25 03:34:25,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 03:34:25,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:34:25,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-25 03:34:25,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:34:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-12-25 03:34:27,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:34:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 93 proven. 29 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-12-25 03:34:55,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:55,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064114105] [2023-12-25 03:34:55,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064114105] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:34:55,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:34:55,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2023-12-25 03:34:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939077427] [2023-12-25 03:34:55,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:34:55,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 03:34:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:55,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 03:34:55,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2023-12-25 03:34:55,854 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 15 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2023-12-25 03:35:06,582 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 90 DAG size of output: 81 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:35:12,614 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 03:35:19,620 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 03:35:31,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:45,419 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 03:35:49,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 03:35:53,643 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 03:36:40,784 WARN L293 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 98 DAG size of output: 86 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:36:44,860 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 03:36:49,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:52,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:53,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:06,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:11,841 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 03:37:15,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:24,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 03:37:27,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:43,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:46,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:06,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 03:38:19,059 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 03:38:23,064 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 03:38:27,119 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 03:38:35,870 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 03:38:41,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:38:41,907 INFO L93 Difference]: Finished difference Result 244 states and 310 transitions. [2023-12-25 03:38:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-25 03:38:41,918 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 15 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) Word has length 100 [2023-12-25 03:38:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:38:41,919 INFO L225 Difference]: With dead ends: 244 [2023-12-25 03:38:41,919 INFO L226 Difference]: Without dead ends: 204 [2023-12-25 03:38:41,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 143.7s TimeCoverageRelationStatistics Valid=564, Invalid=2508, Unknown=8, NotChecked=0, Total=3080 [2023-12-25 03:38:41,920 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 129 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 188 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:38:41,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 475 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 525 Invalid, 15 Unknown, 0 Unchecked, 97.3s Time] [2023-12-25 03:38:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-25 03:38:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2023-12-25 03:38:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 123 states have internal predecessors, (136), 56 states have call successors, (56), 21 states have call predecessors, (56), 21 states have return successors, (55), 52 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-25 03:38:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2023-12-25 03:38:41,972 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 100 [2023-12-25 03:38:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:38:41,972 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2023-12-25 03:38:41,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 25 states have internal predecessors, (52), 15 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2023-12-25 03:38:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2023-12-25 03:38:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 03:38:41,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:38:41,974 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:38:41,978 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 (16)] Forceful destruction successful, exit code 0 [2023-12-25 03:38:42,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 03:38:42,178 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:38:42,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:38:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2000529897, now seen corresponding path program 4 times [2023-12-25 03:38:42,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:38:42,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038905682] [2023-12-25 03:38:42,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 03:38:42,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 03:38:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:38:42,193 INFO L229 MonitoredProcess]: Starting monitored process 17 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 03:38:42,211 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 (17)] Waiting until timeout for monitored process [2023-12-25 03:38:42,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 03:38:42,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:38:42,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 03:38:42,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:38:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 83 proven. 49 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-12-25 03:38:43,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:38:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 86 proven. 46 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-12-25 03:38:54,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:38:54,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038905682] [2023-12-25 03:38:54,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038905682] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:38:54,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:38:54,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-12-25 03:38:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669115088] [2023-12-25 03:38:54,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:38:54,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 03:38:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:38:54,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 03:38:54,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-12-25 03:38:54,553 INFO L87 Difference]: Start difference. First operand 197 states and 247 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 22 states have internal predecessors, (52), 15 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 16 states have call predecessors, (34), 15 states have call successors, (34) [2023-12-25 03:39:03,250 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 03:39:09,137 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 03:39:16,055 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 03:39:20,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:26,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:28,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:35,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:43,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:47,542 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 03:39:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:39:47,548 INFO L93 Difference]: Finished difference Result 232 states and 296 transitions. [2023-12-25 03:39:47,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 03:39:47,556 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 22 states have internal predecessors, (52), 15 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 16 states have call predecessors, (34), 15 states have call successors, (34) Word has length 105 [2023-12-25 03:39:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:39:47,558 INFO L225 Difference]: With dead ends: 232 [2023-12-25 03:39:47,558 INFO L226 Difference]: Without dead ends: 229 [2023-12-25 03:39:47,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=332, Invalid=1738, Unknown=0, NotChecked=0, Total=2070 [2023-12-25 03:39:47,559 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 149 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 171 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:39:47,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 428 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 442 Invalid, 8 Unknown, 0 Unchecked, 39.2s Time] [2023-12-25 03:39:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-25 03:39:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 222. [2023-12-25 03:39:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 141 states have internal predecessors, (150), 66 states have call successors, (66), 23 states have call predecessors, (66), 23 states have return successors, (64), 57 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-25 03:39:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 280 transitions. [2023-12-25 03:39:47,637 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 280 transitions. Word has length 105 [2023-12-25 03:39:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:39:47,637 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 280 transitions. [2023-12-25 03:39:47,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 22 states have internal predecessors, (52), 15 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 16 states have call predecessors, (34), 15 states have call successors, (34) [2023-12-25 03:39:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 280 transitions. [2023-12-25 03:39:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 03:39:47,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:39:47,639 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:39:47,644 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 (17)] Ended with exit code 0 [2023-12-25 03:39:47,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 03:39:47,844 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:39:47,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:39:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 924515754, now seen corresponding path program 3 times [2023-12-25 03:39:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:39:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284725835] [2023-12-25 03:39:47,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:39:47,845 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 03:39:47,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:39:47,846 INFO L229 MonitoredProcess]: Starting monitored process 18 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 03:39:47,847 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 (18)] Waiting until timeout for monitored process [2023-12-25 03:40:20,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 03:40:20,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:40:20,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 03:40:20,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:40:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 108 proven. 19 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2023-12-25 03:40:23,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:40:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-25 03:40:30,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:40:30,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284725835] [2023-12-25 03:40:30,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284725835] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:40:30,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:40:30,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 22 [2023-12-25 03:40:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353414513] [2023-12-25 03:40:30,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:40:30,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 03:40:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:40:30,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 03:40:30,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=393, Unknown=1, NotChecked=0, Total=462 [2023-12-25 03:40:30,625 INFO L87 Difference]: Start difference. First operand 222 states and 280 transitions. Second operand has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 10 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (26), 11 states have call predecessors, (26), 8 states have call successors, (26) [2023-12-25 03:40:41,808 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 [0] [2023-12-25 03:40:54,278 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification. DAG size of input: 28 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:40:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:40:57,300 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2023-12-25 03:40:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 03:40:57,314 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 10 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (26), 11 states have call predecessors, (26), 8 states have call successors, (26) Word has length 111 [2023-12-25 03:40:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:40:57,315 INFO L225 Difference]: With dead ends: 238 [2023-12-25 03:40:57,315 INFO L226 Difference]: Without dead ends: 209 [2023-12-25 03:40:57,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=166, Invalid=825, Unknown=1, NotChecked=0, Total=992 [2023-12-25 03:40:57,316 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-25 03:40:57,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 239 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2023-12-25 03:40:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-25 03:40:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 190. [2023-12-25 03:40:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 113 states have (on average 1.1238938053097345) internal successors, (127), 121 states have internal predecessors, (127), 55 states have call successors, (55), 21 states have call predecessors, (55), 21 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-25 03:40:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 236 transitions. [2023-12-25 03:40:57,388 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 236 transitions. Word has length 111 [2023-12-25 03:40:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:40:57,388 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 236 transitions. [2023-12-25 03:40:57,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 10 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (26), 11 states have call predecessors, (26), 8 states have call successors, (26) [2023-12-25 03:40:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 236 transitions. [2023-12-25 03:40:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-25 03:40:57,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:40:57,389 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:40:57,401 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 (18)] Forceful destruction successful, exit code 0 [2023-12-25 03:40:57,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 03:40:57,599 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:40:57,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:40:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 678054389, now seen corresponding path program 1 times [2023-12-25 03:40:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:40:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253494000] [2023-12-25 03:40:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:40:57,601 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 03:40:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:40:57,602 INFO L229 MonitoredProcess]: Starting monitored process 19 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 03:40:57,603 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 (19)] Waiting until timeout for monitored process [2023-12-25 03:40:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:40:57,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 03:40:57,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:40:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 162 proven. 21 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-12-25 03:40:58,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:40:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2023-12-25 03:40:58,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:40:58,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253494000] [2023-12-25 03:40:58,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253494000] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:40:58,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:40:58,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2023-12-25 03:40:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576870817] [2023-12-25 03:40:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:40:58,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 03:40:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:40:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 03:40:58,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-25 03:40:58,818 INFO L87 Difference]: Start difference. First operand 190 states and 236 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 03:40:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:40:59,006 INFO L93 Difference]: Finished difference Result 226 states and 273 transitions. [2023-12-25 03:40:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 03:40:59,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2023-12-25 03:40:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:40:59,007 INFO L225 Difference]: With dead ends: 226 [2023-12-25 03:40:59,007 INFO L226 Difference]: Without dead ends: 168 [2023-12-25 03:40:59,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-25 03:40:59,008 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:40:59,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:40:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-25 03:40:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-12-25 03:40:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 107 states have internal predecessors, (110), 44 states have call successors, (44), 21 states have call predecessors, (44), 21 states have return successors, (43), 39 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-25 03:40:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2023-12-25 03:40:59,067 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 117 [2023-12-25 03:40:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:40:59,067 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2023-12-25 03:40:59,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-25 03:40:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2023-12-25 03:40:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-25 03:40:59,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:40:59,068 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:40:59,076 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 (19)] Forceful destruction successful, exit code 0 [2023-12-25 03:40:59,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 03:40:59,274 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:40:59,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:40:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1126383642, now seen corresponding path program 5 times [2023-12-25 03:40:59,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:40:59,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230181037] [2023-12-25 03:40:59,275 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 03:40:59,275 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 03:40:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:40:59,276 INFO L229 MonitoredProcess]: Starting monitored process 20 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 03:40:59,299 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 (20)] Waiting until timeout for monitored process [2023-12-25 03:40:59,433 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-12-25 03:40:59,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:40:59,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-25 03:40:59,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:41:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 91 proven. 199 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-12-25 03:41:01,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:41:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 91 proven. 193 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2023-12-25 03:41:43,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:41:43,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230181037] [2023-12-25 03:41:43,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230181037] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:41:43,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:41:43,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2023-12-25 03:41:43,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116002028] [2023-12-25 03:41:43,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:41:43,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 03:41:43,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:41:43,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 03:41:43,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 03:41:43,106 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand has 36 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 26 states have internal predecessors, (52), 21 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (40), 21 states have call predecessors, (40), 19 states have call successors, (40) [2023-12-25 03:42:00,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:42:01,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:42:04,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:42:10,751 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 03:42:26,574 WARN L293 SmtUtils]: Spent 10.83s on a formula simplification. DAG size of input: 73 DAG size of output: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:42:40,440 WARN L293 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 89 DAG size of output: 81 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:42:57,251 WARN L293 SmtUtils]: Spent 9.66s on a formula simplification. DAG size of input: 92 DAG size of output: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:43:03,475 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 03:43:08,367 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 03:43:19,481 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 03:43:23,623 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 03:43:50,767 WARN L293 SmtUtils]: Spent 12.67s on a formula simplification. DAG size of input: 109 DAG size of output: 104 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:43:55,603 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 03:43:59,608 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 03:44:00,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:44:01,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:44:05,964 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 03:44:16,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:01,962 WARN L293 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 82 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:45:26,695 WARN L293 SmtUtils]: Spent 12.82s on a formula simplification. DAG size of input: 82 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:45:30,742 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 03:45:34,747 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 03:45:38,849 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 03:46:14,187 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 03:46:18,191 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 03:46:22,195 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 03:46:43,829 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 03:46:47,892 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 03:46:57,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:02,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:47:02,347 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2023-12-25 03:47:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-25 03:47:02,360 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 26 states have internal predecessors, (52), 21 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (40), 21 states have call predecessors, (40), 19 states have call successors, (40) Word has length 121 [2023-12-25 03:47:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:47:02,361 INFO L225 Difference]: With dead ends: 257 [2023-12-25 03:47:02,361 INFO L226 Difference]: Without dead ends: 255 [2023-12-25 03:47:02,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 235.9s TimeCoverageRelationStatistics Valid=966, Invalid=3863, Unknown=1, NotChecked=0, Total=4830 [2023-12-25 03:47:02,363 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 174 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 254 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 111.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 113.4s IncrementalHoareTripleChecker+Time [2023-12-25 03:47:02,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 854 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 966 Invalid, 18 Unknown, 0 Unchecked, 113.4s Time] [2023-12-25 03:47:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-25 03:47:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 218. [2023-12-25 03:47:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 130 states have (on average 1.0923076923076922) internal successors, (142), 137 states have internal predecessors, (142), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-25 03:47:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 263 transitions. [2023-12-25 03:47:02,457 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 263 transitions. Word has length 121 [2023-12-25 03:47:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:47:02,457 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 263 transitions. [2023-12-25 03:47:02,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 26 states have internal predecessors, (52), 21 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (40), 21 states have call predecessors, (40), 19 states have call successors, (40) [2023-12-25 03:47:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 263 transitions. [2023-12-25 03:47:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-25 03:47:02,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:47:02,458 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:47:02,464 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 (20)] Ended with exit code 0 [2023-12-25 03:47:02,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 03:47:02,664 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:47:02,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:47:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2028160189, now seen corresponding path program 6 times [2023-12-25 03:47:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:47:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522249976] [2023-12-25 03:47:02,665 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 03:47:02,665 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 03:47:02,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:47:02,666 INFO L229 MonitoredProcess]: Starting monitored process 21 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 03:47:02,698 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 (21)] Waiting until timeout for monitored process [2023-12-25 03:47:03,363 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-12-25 03:47:03,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:47:03,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 03:47:03,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-25 03:47:05,653 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 03:47:05,653 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 03:47:06,661 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 (21)] Forceful destruction successful, exit code 0 [2023-12-25 03:47:06,858 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 03:47:06,878 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:47:06,878 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 127 with TraceHistMax 19,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-25 03:47:06,881 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:47:06,883 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:47:06,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 03:47:06,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:47:06 BoogieIcfgContainer [2023-12-25 03:47:06,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:47:06,888 INFO L158 Benchmark]: Toolchain (without parser) took 883574.98ms. Allocated memory was 217.1MB in the beginning and 305.1MB in the end (delta: 88.1MB). Free memory was 156.7MB in the beginning and 123.6MB in the end (delta: 33.0MB). Peak memory consumption was 121.9MB. Max. memory is 8.0GB. [2023-12-25 03:47:06,889 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 217.1MB. Free memory was 167.6MB in the beginning and 167.5MB in the end (delta: 155.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:47:06,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.54ms. Allocated memory is still 217.1MB. Free memory was 156.4MB in the beginning and 144.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 03:47:06,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.59ms. Allocated memory is still 217.1MB. Free memory was 144.9MB in the beginning and 143.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:47:06,889 INFO L158 Benchmark]: Boogie Preprocessor took 30.44ms. Allocated memory is still 217.1MB. Free memory was 143.3MB in the beginning and 141.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 03:47:06,890 INFO L158 Benchmark]: RCFGBuilder took 327.66ms. Allocated memory was 217.1MB in the beginning and 305.1MB in the end (delta: 88.1MB). Free memory was 141.5MB in the beginning and 267.0MB in the end (delta: -125.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2023-12-25 03:47:06,891 INFO L158 Benchmark]: TraceAbstraction took 882969.48ms. Allocated memory is still 305.1MB. Free memory was 265.9MB in the beginning and 123.6MB in the end (delta: 142.3MB). Peak memory consumption was 142.0MB. Max. memory is 8.0GB. [2023-12-25 03:47:06,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 217.1MB. Free memory was 167.6MB in the beginning and 167.5MB in the end (delta: 155.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.54ms. Allocated memory is still 217.1MB. Free memory was 156.4MB in the beginning and 144.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.59ms. Allocated memory is still 217.1MB. Free memory was 144.9MB in the beginning and 143.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.44ms. Allocated memory is still 217.1MB. Free memory was 143.3MB in the beginning and 141.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 327.66ms. Allocated memory was 217.1MB in the beginning and 305.1MB in the end (delta: 88.1MB). Free memory was 141.5MB in the beginning and 267.0MB in the end (delta: -125.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * TraceAbstraction took 882969.48ms. Allocated memory is still 305.1MB. Free memory was 265.9MB in the beginning and 123.6MB in the end (delta: 142.3MB). Peak memory consumption was 142.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was analyzing trace of length 127 with TraceHistMax 19,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 882.9s, OverallIterations: 18, TraceHistogramMax: 19, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 693.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 49 mSolverCounterUnknown, 829 SdHoareTripleChecker+Valid, 303.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 4052 SdHoareTripleChecker+Invalid, 296.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3457 mSDsCounter, 942 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3636 IncrementalHoareTripleChecker+Invalid, 4627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 942 mSolverCounterUnsat, 595 mSDtfsCounter, 3636 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2476 GetRequests, 2114 SyntacticMatches, 4 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2818 ImplicationChecksByTransitivity, 488.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=14, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 139 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 33.5s SatisfiabilityAnalysisTime, 146.2s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1244 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2331 ConstructedInterpolants, 21 QuantifiedInterpolants, 12548 SizeOfPredicates, 92 NumberOfNonLiveVariables, 2034 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 6818/7577 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown