/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/divbin2_valuebound50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:19:00,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:19:01,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 01:19:01,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:19:01,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:19:01,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:19:01,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:19:01,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:19:01,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:19:01,043 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:19:01,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:19:01,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:19:01,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:19:01,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:19:01,045 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:19:01,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:19:01,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:19:01,046 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:19:01,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:19:01,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:19:01,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:19:01,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:19:01,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:19:01,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:19:01,047 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:19:01,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:19:01,047 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:19:01,047 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:19:01,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:19:01,048 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:19:01,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:19:01,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:19:01,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:19:01,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:19:01,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:19:01,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:19:01,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:19:01,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:19:01,049 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:19:01,049 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:19:01,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:19:01,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:19:01,050 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:19:01,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:19:01,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:19:01,050 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:19:01,050 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 01:19:01,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:19:01,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:19:01,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:19:01,258 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:19:01,259 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:19:01,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound50.i [2023-12-25 01:19:02,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:19:02,468 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:19:02,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound50.i [2023-12-25 01:19:02,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c194a7b90/a3bcfa9d965c49aabfd49f4a435720ff/FLAGb04bfa92d [2023-12-25 01:19:02,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c194a7b90/a3bcfa9d965c49aabfd49f4a435720ff [2023-12-25 01:19:02,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:19:02,488 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:19:02,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:19:02,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:19:02,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:19:02,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62832546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02, skipping insertion in model container [2023-12-25 01:19:02,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,511 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:19:02,616 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/divbin2_valuebound50.i[951,964] [2023-12-25 01:19:02,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:19:02,633 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:19:02,641 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/divbin2_valuebound50.i[951,964] [2023-12-25 01:19:02,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:19:02,654 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:19:02,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02 WrapperNode [2023-12-25 01:19:02,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:19:02,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:19:02,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:19:02,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:19:02,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,686 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2023-12-25 01:19:02,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:19:02,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:19:02,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:19:02,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:19:02,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,702 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:19:02,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:19:02,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:19:02,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:19:02,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:19:02,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (1/1) ... [2023-12-25 01:19:02,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:19:02,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:19:02,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 01:19:02,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 01:19:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:19:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:19:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:19:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:19:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:19:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:19:02,889 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:19:02,892 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:19:03,065 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:19:03,097 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:19:03,097 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:19:03,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:19:03 BoogieIcfgContainer [2023-12-25 01:19:03,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:19:03,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:19:03,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:19:03,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:19:03,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:19:02" (1/3) ... [2023-12-25 01:19:03,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2739f541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:19:03, skipping insertion in model container [2023-12-25 01:19:03,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:19:02" (2/3) ... [2023-12-25 01:19:03,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2739f541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:19:03, skipping insertion in model container [2023-12-25 01:19:03,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:19:03" (3/3) ... [2023-12-25 01:19:03,105 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound50.i [2023-12-25 01:19:03,121 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:19:03,122 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:19:03,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:19:03,182 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;@501b8c61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:19:03,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:19:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:19:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 01:19:03,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:03,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:03,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:03,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash 334653711, now seen corresponding path program 1 times [2023-12-25 01:19:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:03,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827826422] [2023-12-25 01:19:03,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:19:03,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:03,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:03,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:03,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:19:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:19:03,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:19:03,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:19:03,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:19:03,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827826422] [2023-12-25 01:19:03,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827826422] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:19:03,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:19:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:19:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717407851] [2023-12-25 01:19:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:19:03,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:19:03,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:03,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:19:03,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:19:03,437 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:19:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:03,457 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2023-12-25 01:19:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:19:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-25 01:19:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:03,464 INFO L225 Difference]: With dead ends: 34 [2023-12-25 01:19:03,464 INFO L226 Difference]: Without dead ends: 16 [2023-12-25 01:19:03,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:19:03,469 INFO L413 NwaCegarLoop]: 19 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, 19 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:03,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:19:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-25 01:19:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-25 01:19:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 01:19:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-25 01:19:03,495 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2023-12-25 01:19:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:03,495 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-25 01:19:03,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:19:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-25 01:19:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 01:19:03,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:03,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:03,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 01:19:03,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:03,699 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:03,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -401566674, now seen corresponding path program 1 times [2023-12-25 01:19:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547910943] [2023-12-25 01:19:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:19:03,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:03,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:03,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:03,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:19:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:19:03,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:19:03,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:19:04,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:19:04,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547910943] [2023-12-25 01:19:04,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547910943] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:19:04,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:19:04,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 01:19:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199460741] [2023-12-25 01:19:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:19:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:19:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:04,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:19:04,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:19:04,010 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:19:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:04,184 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-25 01:19:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:19:04,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-25 01:19:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:04,186 INFO L225 Difference]: With dead ends: 28 [2023-12-25 01:19:04,186 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 01:19:04,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:19:04,188 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:04,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:19:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 01:19:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-25 01:19:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:19:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-25 01:19:04,193 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2023-12-25 01:19:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:04,194 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-25 01:19:04,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:19:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-25 01:19:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 01:19:04,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:04,194 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:04,200 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 01:19:04,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:04,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:04,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1504476233, now seen corresponding path program 1 times [2023-12-25 01:19:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:04,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658647264] [2023-12-25 01:19:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:19:04,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:04,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:04,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:19:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:19:04,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:19:04,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:19:04,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:19:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:19:05,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658647264] [2023-12-25 01:19:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658647264] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:19:05,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:19:05,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-12-25 01:19:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619175697] [2023-12-25 01:19:05,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:19:05,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:19:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:19:05,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:19:05,707 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:19:10,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 01:19:14,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:15,508 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2023-12-25 01:19:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:19:15,509 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-25 01:19:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:15,511 INFO L225 Difference]: With dead ends: 59 [2023-12-25 01:19:15,511 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 01:19:15,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-12-25 01:19:15,512 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:15,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 95 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2023-12-25 01:19:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 01:19:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2023-12-25 01:19:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 01:19:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2023-12-25 01:19:15,523 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 12 [2023-12-25 01:19:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:15,524 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2023-12-25 01:19:15,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:19:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2023-12-25 01:19:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:19:15,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:15,525 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:15,537 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 (4)] Ended with exit code 0 [2023-12-25 01:19:15,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:15,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:15,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1989427041, now seen corresponding path program 1 times [2023-12-25 01:19:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189554741] [2023-12-25 01:19:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:19:15,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:15,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:15,731 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:15,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 01:19:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:19:15,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 01:19:15,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:19:15,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:19:15,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:15,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189554741] [2023-12-25 01:19:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189554741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:19:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:19:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:19:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376917042] [2023-12-25 01:19:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:19:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 01:19:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 01:19:15,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 01:19:15,800 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 01:19:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:15,830 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2023-12-25 01:19:15,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 01:19:15,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-12-25 01:19:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:15,831 INFO L225 Difference]: With dead ends: 65 [2023-12-25 01:19:15,831 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 01:19:15,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 01:19:15,832 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:15,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:19:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 01:19:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-25 01:19:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:19:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2023-12-25 01:19:15,843 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 18 [2023-12-25 01:19:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:15,843 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2023-12-25 01:19:15,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 01:19:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2023-12-25 01:19:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:19:15,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:15,844 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:15,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 01:19:16,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:16,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:16,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1842785254, now seen corresponding path program 2 times [2023-12-25 01:19:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810333921] [2023-12-25 01:19:16,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:19:16,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:16,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:16,048 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:16,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 01:19:16,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 01:19:16,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:19:16,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 01:19:16,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 01:19:16,214 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:19:16,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:16,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810333921] [2023-12-25 01:19:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810333921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:19:16,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:19:16,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 01:19:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341825253] [2023-12-25 01:19:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:19:16,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 01:19:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:16,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 01:19:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 01:19:16,216 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:19:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:16,373 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2023-12-25 01:19:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 01:19:16,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-25 01:19:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:16,375 INFO L225 Difference]: With dead ends: 57 [2023-12-25 01:19:16,375 INFO L226 Difference]: Without dead ends: 54 [2023-12-25 01:19:16,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 01:19:16,377 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:16,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 42 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:19:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-25 01:19:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-12-25 01:19:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:19:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-12-25 01:19:16,387 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 18 [2023-12-25 01:19:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:16,387 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-12-25 01:19:16,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:19:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-12-25 01:19:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 01:19:16,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:16,388 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:16,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 01:19:16,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:16,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:16,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash 653827799, now seen corresponding path program 1 times [2023-12-25 01:19:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454460150] [2023-12-25 01:19:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:19:16,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:16,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:16,608 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:16,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:19:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:19:16,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 01:19:16,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:19:16,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:19:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:19:18,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:18,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454460150] [2023-12-25 01:19:18,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454460150] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:19:18,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:19:18,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 01:19:18,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756602049] [2023-12-25 01:19:18,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:19:18,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:19:18,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:18,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:19:18,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:19:18,991 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:19:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:25,282 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2023-12-25 01:19:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 01:19:25,285 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-12-25 01:19:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:25,286 INFO L225 Difference]: With dead ends: 117 [2023-12-25 01:19:25,286 INFO L226 Difference]: Without dead ends: 95 [2023-12-25 01:19:25,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2023-12-25 01:19:25,288 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:25,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 193 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-25 01:19:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-25 01:19:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2023-12-25 01:19:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 66 states have internal predecessors, (76), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:19:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2023-12-25 01:19:25,304 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 22 [2023-12-25 01:19:25,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:25,304 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2023-12-25 01:19:25,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:19:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2023-12-25 01:19:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 01:19:25,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:25,305 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:25,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 01:19:25,507 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 01:19:25,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:25,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1620400559, now seen corresponding path program 2 times [2023-12-25 01:19:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:25,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754235083] [2023-12-25 01:19:25,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:19:25,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:25,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:25,511 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 01:19:25,511 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 01:19:25,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:19:25,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:19:25,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:19:25,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:19:25,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:19:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:19:25,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:25,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754235083] [2023-12-25 01:19:25,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754235083] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:19:25,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:19:25,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2023-12-25 01:19:25,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643524057] [2023-12-25 01:19:25,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:19:25,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 01:19:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 01:19:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-25 01:19:25,663 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:19:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:25,758 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2023-12-25 01:19:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:19:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2023-12-25 01:19:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:25,761 INFO L225 Difference]: With dead ends: 122 [2023-12-25 01:19:25,761 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 01:19:25,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-25 01:19:25,763 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:25,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:19:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 01:19:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-12-25 01:19:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 55 states have internal predecessors, (63), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:19:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2023-12-25 01:19:25,788 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 28 [2023-12-25 01:19:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:25,789 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2023-12-25 01:19:25,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:19:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2023-12-25 01:19:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 01:19:25,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:25,790 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:25,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:19:25,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 01:19:25,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:25,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash 263511235, now seen corresponding path program 3 times [2023-12-25 01:19:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:25,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619527371] [2023-12-25 01:19:25,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:19:25,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:25,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:25,998 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:26,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 01:19:26,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-25 01:19:26,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:19:26,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:19:26,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 01:19:26,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:19:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 01:19:32,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619527371] [2023-12-25 01:19:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619527371] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:19:32,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:19:32,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-25 01:19:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893105139] [2023-12-25 01:19:32,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:19:32,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 01:19:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 01:19:32,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:19:32,486 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:19:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:34,419 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2023-12-25 01:19:34,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:19:34,419 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-12-25 01:19:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:34,420 INFO L225 Difference]: With dead ends: 102 [2023-12-25 01:19:34,420 INFO L226 Difference]: Without dead ends: 98 [2023-12-25 01:19:34,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:19:34,421 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:34,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 148 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 01:19:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-25 01:19:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2023-12-25 01:19:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 01:19:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2023-12-25 01:19:34,437 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 30 [2023-12-25 01:19:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:34,437 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2023-12-25 01:19:34,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:19:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2023-12-25 01:19:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 01:19:34,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:34,439 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:34,444 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 (9)] Ended with exit code 0 [2023-12-25 01:19:34,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:34,642 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:34,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1673092517, now seen corresponding path program 4 times [2023-12-25 01:19:34,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405232460] [2023-12-25 01:19:34,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 01:19:34,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:34,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:34,644 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:34,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 01:19:34,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 01:19:34,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:19:34,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 01:19:34,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:19:35,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:19:55,645 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:20:07,704 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:20:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 01:20:07,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:20:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405232460] [2023-12-25 01:20:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405232460] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:20:07,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:20:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2023-12-25 01:20:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253582668] [2023-12-25 01:20:07,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:20:07,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 01:20:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:20:07,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 01:20:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:20:07,915 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:20:22,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:20:27,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:20:31,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:20:36,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:20:49,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:20:53,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:01,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:21:01,738 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2023-12-25 01:21:01,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 01:21:01,742 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2023-12-25 01:21:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:21:01,743 INFO L225 Difference]: With dead ends: 169 [2023-12-25 01:21:01,743 INFO L226 Difference]: Without dead ends: 130 [2023-12-25 01:21:01,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=419, Invalid=1561, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 01:21:01,745 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 113 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 71 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:21:01,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 248 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 425 Invalid, 4 Unknown, 0 Unchecked, 30.5s Time] [2023-12-25 01:21:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-25 01:21:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2023-12-25 01:21:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 92 states have internal predecessors, (100), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 11 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 01:21:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2023-12-25 01:21:01,792 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 32 [2023-12-25 01:21:01,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:21:01,792 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2023-12-25 01:21:01,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:21:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2023-12-25 01:21:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 01:21:01,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:21:01,795 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:21:01,799 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:21:01,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:21:01,999 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:21:01,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:21:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1466163010, now seen corresponding path program 1 times [2023-12-25 01:21:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:21:01,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672192370] [2023-12-25 01:21:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:21:01,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:21:02,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:21:02,000 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:21:02,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 01:21:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:21:02,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 01:21:02,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:21:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:21:02,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:21:22,684 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:21:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 01:21:22,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:21:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672192370] [2023-12-25 01:21:22,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672192370] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:21:22,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:21:22,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 27 [2023-12-25 01:21:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850298891] [2023-12-25 01:21:22,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:21:22,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 01:21:22,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:21:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 01:21:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:21:22,826 INFO L87 Difference]: Start difference. First operand 113 states and 136 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:21:33,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:49,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:53,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:21:57,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:22:01,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:22:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:01,959 INFO L93 Difference]: Finished difference Result 204 states and 244 transitions. [2023-12-25 01:22:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 01:22:01,964 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2023-12-25 01:22:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:01,966 INFO L225 Difference]: With dead ends: 204 [2023-12-25 01:22:01,966 INFO L226 Difference]: Without dead ends: 174 [2023-12-25 01:22:01,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=346, Invalid=1214, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 01:22:01,968 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 72 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:01,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 211 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 417 Invalid, 4 Unknown, 0 Unchecked, 24.3s Time] [2023-12-25 01:22:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-25 01:22:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2023-12-25 01:22:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 120 states have (on average 1.175) internal successors, (141), 129 states have internal predecessors, (141), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (27), 18 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-25 01:22:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2023-12-25 01:22:02,029 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 34 [2023-12-25 01:22:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:02,030 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2023-12-25 01:22:02,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:22:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2023-12-25 01:22:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 01:22:02,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:02,031 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:02,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 01:22:02,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:02,235 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:02,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1670815805, now seen corresponding path program 5 times [2023-12-25 01:22:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610983803] [2023-12-25 01:22:02,235 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 01:22:02,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:02,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:02,237 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:22:02,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 01:22:02,318 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-25 01:22:02,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:22:02,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:22:02,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:22:02,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:22:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:22:02,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:02,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610983803] [2023-12-25 01:22:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610983803] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:22:02,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:22:02,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2023-12-25 01:22:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475440020] [2023-12-25 01:22:02,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:22:02,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 01:22:02,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:02,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 01:22:02,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:22:02,568 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:22:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:22:02,786 INFO L93 Difference]: Finished difference Result 182 states and 219 transitions. [2023-12-25 01:22:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:22:02,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-12-25 01:22:02,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:22:02,791 INFO L225 Difference]: With dead ends: 182 [2023-12-25 01:22:02,791 INFO L226 Difference]: Without dead ends: 151 [2023-12-25 01:22:02,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:22:02,791 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:22:02,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 01:22:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-25 01:22:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2023-12-25 01:22:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 109 states have (on average 1.1743119266055047) internal successors, (128), 116 states have internal predecessors, (128), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-25 01:22:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 174 transitions. [2023-12-25 01:22:02,845 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 174 transitions. Word has length 38 [2023-12-25 01:22:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:22:02,845 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 174 transitions. [2023-12-25 01:22:02,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:22:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 174 transitions. [2023-12-25 01:22:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 01:22:02,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:22:02,846 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-12-25 01:22:02,850 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 01:22:03,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:03,047 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:22:03,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:22:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1953060685, now seen corresponding path program 6 times [2023-12-25 01:22:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:22:03,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325099496] [2023-12-25 01:22:03,048 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 01:22:03,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:22:03,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:22:03,049 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:22:03,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 01:22:03,113 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-12-25 01:22:03,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:22:03,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-25 01:22:03,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:22:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 01:22:04,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:22:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 01:22:39,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:22:39,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325099496] [2023-12-25 01:22:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325099496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:22:39,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:22:39,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2023-12-25 01:22:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741577885] [2023-12-25 01:22:39,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:22:39,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 01:22:39,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:22:39,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 01:22:39,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 01:22:39,221 INFO L87 Difference]: Start difference. First operand 145 states and 174 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 31 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:23:15,916 WARN L293 SmtUtils]: Spent 33.59s on a formula simplification. DAG size of input: 160 DAG size of output: 125 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:23:38,514 WARN L293 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 146 DAG size of output: 113 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:23:50,109 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:24:01,392 WARN L293 SmtUtils]: Spent 9.57s on a formula simplification. DAG size of input: 140 DAG size of output: 104 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:24:12,490 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 136 DAG size of output: 131 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:24:14,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:24:16,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:24:25,759 WARN L293 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 124 DAG size of output: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:24:29,796 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 01:24:33,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:24:37,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:24:41,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:24:46,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:24:58,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:24:59,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:25:01,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:25:08,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:25:12,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:25:16,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:25:20,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:25:39,724 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 125 DAG size of output: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:25:55,130 WARN L293 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 103 DAG size of output: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:26:00,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:26:05,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:26:34,093 WARN L293 SmtUtils]: Spent 20.64s on a formula simplification. DAG size of input: 134 DAG size of output: 126 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:26:42,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:26:46,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:26:50,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:27:04,678 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 01:27:08,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:27:12,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:27:16,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:27:20,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:27:24,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:27:41,028 WARN L293 SmtUtils]: Spent 13.53s on a formula simplification. DAG size of input: 150 DAG size of output: 113 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:27:45,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:27:49,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:27:53,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:27:57,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:28:27,079 WARN L293 SmtUtils]: Spent 23.38s on a formula simplification. DAG size of input: 159 DAG size of output: 124 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:28:33,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:28:53,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:28:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:28:56,416 INFO L93 Difference]: Finished difference Result 237 states and 293 transitions. [2023-12-25 01:28:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-25 01:28:56,423 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 31 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-12-25 01:28:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:28:56,424 INFO L225 Difference]: With dead ends: 237 [2023-12-25 01:28:56,424 INFO L226 Difference]: Without dead ends: 235 [2023-12-25 01:28:56,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 259.3s TimeCoverageRelationStatistics Valid=906, Invalid=3383, Unknown=1, NotChecked=0, Total=4290 [2023-12-25 01:28:56,425 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 159 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 103 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 131.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 132.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:28:56,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 332 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 563 Invalid, 25 Unknown, 0 Unchecked, 132.3s Time] [2023-12-25 01:28:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-12-25 01:28:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 203. [2023-12-25 01:28:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.1920529801324504) internal successors, (180), 162 states have internal predecessors, (180), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 25 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-25 01:28:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 252 transitions. [2023-12-25 01:28:56,537 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 252 transitions. Word has length 42 [2023-12-25 01:28:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:28:56,537 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 252 transitions. [2023-12-25 01:28:56,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 31 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:28:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 252 transitions. [2023-12-25 01:28:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 01:28:56,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:28:56,538 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:28:56,542 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 01:28:56,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 01:28:56,739 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:28:56,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:28:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1665329652, now seen corresponding path program 2 times [2023-12-25 01:28:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:28:56,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541401291] [2023-12-25 01:28:56,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:28:56,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:28:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:28:56,741 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:28:56,742 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 (14)] Waiting until timeout for monitored process [2023-12-25 01:28:56,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:28:56,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:28:56,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 01:28:56,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:28:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 01:28:58,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:29:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:29:35,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:29:35,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541401291] [2023-12-25 01:29:35,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541401291] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:29:35,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:29:35,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2023-12-25 01:29:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977021034] [2023-12-25 01:29:35,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:29:35,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 01:29:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:29:35,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 01:29:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 01:29:35,245 INFO L87 Difference]: Start difference. First operand 203 states and 252 transitions. Second operand has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 30 states have internal predecessors, (60), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:29:51,079 WARN L293 SmtUtils]: Spent 10.93s on a formula simplification. DAG size of input: 154 DAG size of output: 100 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:29:52,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:29:55,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:29:56,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:15,604 WARN L293 SmtUtils]: Spent 17.04s on a formula simplification that was a NOOP. DAG size: 156 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:30:30,986 WARN L293 SmtUtils]: Spent 13.35s on a formula simplification. DAG size of input: 131 DAG size of output: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:30:51,125 WARN L293 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 128 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:30:56,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:30:58,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:10,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:14,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:18,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:22,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:26,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:32,220 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 01:31:41,742 WARN L293 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 67 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:31:45,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:49,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:31:53,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:24,998 WARN L293 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:32:27,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:31,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:35,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:46,247 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 64 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:32:47,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:51,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:56,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:33:00,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:33:04,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:33:08,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:33:37,120 WARN L293 SmtUtils]: Spent 14.94s on a formula simplification. DAG size of input: 126 DAG size of output: 103 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:33:39,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:33:43,935 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 [] Received shutdown request... [2023-12-25 01:33:45,662 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 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:33:45,662 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 01:33:46,668 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 (14)] Forceful destruction successful, exit code 0 [2023-12-25 01:33:46,862 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 01:33:46,875 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 01:33:46,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 171.4s TimeCoverageRelationStatistics Valid=676, Invalid=2404, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 01:33:46,876 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 153 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 119 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 94.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 94.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:33:46,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 389 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 649 Invalid, 15 Unknown, 0 Unchecked, 94.8s Time] [2023-12-25 01:33:46,877 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:33:46,878 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 01:33:46,881 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1] [2023-12-25 01:33:46,882 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:33:46,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:33:46 BoogieIcfgContainer [2023-12-25 01:33:46,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:33:46,884 INFO L158 Benchmark]: Toolchain (without parser) took 884395.32ms. Allocated memory is still 253.8MB. Free memory was 200.7MB in the beginning and 193.3MB in the end (delta: 7.3MB). Peak memory consumption was 134.3MB. Max. memory is 8.0GB. [2023-12-25 01:33:46,884 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 202.4MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:33:46,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.50ms. Allocated memory is still 253.8MB. Free memory was 200.7MB in the beginning and 189.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:33:46,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.09ms. Allocated memory is still 253.8MB. Free memory was 189.1MB in the beginning and 187.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:33:46,884 INFO L158 Benchmark]: Boogie Preprocessor took 23.14ms. Allocated memory is still 253.8MB. Free memory was 187.7MB in the beginning and 185.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:33:46,884 INFO L158 Benchmark]: RCFGBuilder took 387.08ms. Allocated memory is still 253.8MB. Free memory was 185.6MB in the beginning and 174.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:33:46,884 INFO L158 Benchmark]: TraceAbstraction took 883783.69ms. Allocated memory is still 253.8MB. Free memory was 173.5MB in the beginning and 193.3MB in the end (delta: -19.8MB). Peak memory consumption was 107.1MB. Max. memory is 8.0GB. [2023-12-25 01:33:46,885 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.13ms. Allocated memory is still 202.4MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 165.50ms. Allocated memory is still 253.8MB. Free memory was 200.7MB in the beginning and 189.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.09ms. Allocated memory is still 253.8MB. Free memory was 189.1MB in the beginning and 187.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.14ms. Allocated memory is still 253.8MB. Free memory was 187.7MB in the beginning and 185.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 387.08ms. Allocated memory is still 253.8MB. Free memory was 185.6MB in the beginning and 174.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 883783.69ms. Allocated memory is still 253.8MB. Free memory was 173.5MB in the beginning and 193.3MB in the end (delta: -19.8MB). Peak memory consumption was 107.1MB. 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: 21]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.7s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 740.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 50 mSolverCounterUnknown, 725 SdHoareTripleChecker+Valid, 294.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 692 mSDsluCounter, 1932 SdHoareTripleChecker+Invalid, 291.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1722 mSDsCounter, 444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2953 IncrementalHoareTripleChecker+Invalid, 3448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 444 mSolverCounterUnsat, 210 mSDtfsCounter, 2953 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 718 GetRequests, 421 SyntacticMatches, 3 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2897 ImplicationChecksByTransitivity, 493.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=12, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 116 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 139.4s InterpolantComputationTime, 337 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 597 ConstructedInterpolants, 20 QuantifiedInterpolants, 9181 SizeOfPredicates, 41 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 340/632 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