/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:31:20,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:31:20,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 03:31:20,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:31:20,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:31:20,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:31:20,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:31:20,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:31:20,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:31:20,707 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:31:20,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:31:20,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:31:20,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:31:20,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:31:20,710 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:31:20,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:31:20,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:31:20,711 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:31:20,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:31:20,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:31:20,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:31:20,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:31:20,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:31:20,712 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:31:20,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:31:20,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:31:20,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:31:20,713 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:31:20,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:31:20,714 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:31:20,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:31:20,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:31:20,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:31:20,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:31:20,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:31:20,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:31:20,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:31:20,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:31:20,716 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:31:20,716 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:31:20,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:31:20,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:31:20,717 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:31:20,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:31:20,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:31:20,718 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:31:20,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 03:31:20,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:31:20,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:31:20,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:31:20,975 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:31:20,975 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:31:20,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound2.c [2023-12-25 03:31:22,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:31:22,330 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:31:22,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound2.c [2023-12-25 03:31:22,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdaff978/e313fe17c85d401db078f62ebcdd2043/FLAG6efcf91c1 [2023-12-25 03:31:22,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdaff978/e313fe17c85d401db078f62ebcdd2043 [2023-12-25 03:31:22,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:31:22,359 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:31:22,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:31:22,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:31:22,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:31:22,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16496886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22, skipping insertion in model container [2023-12-25 03:31:22,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,389 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:31:22,526 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound2.c[537,550] [2023-12-25 03:31:22,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:31:22,552 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:31:22,561 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound2.c[537,550] [2023-12-25 03:31:22,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:31:22,580 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:31:22,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22 WrapperNode [2023-12-25 03:31:22,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:31:22,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:31:22,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:31:22,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:31:22,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,607 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-12-25 03:31:22,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:31:22,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:31:22,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:31:22,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:31:22,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,629 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 03:31:22,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:31:22,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:31:22,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:31:22,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:31:22,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (1/1) ... [2023-12-25 03:31:22,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:31:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:31:22,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 03:31:22,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 03:31:22,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:31:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:31:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 03:31:22,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 03:31:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:31:22,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:31:22,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:31:22,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:31:22,785 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:31:22,789 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:31:22,995 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:31:23,027 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:31:23,027 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 03:31:23,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:31:23 BoogieIcfgContainer [2023-12-25 03:31:23,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:31:23,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:31:23,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:31:23,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:31:23,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:31:22" (1/3) ... [2023-12-25 03:31:23,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f68fc4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:31:23, skipping insertion in model container [2023-12-25 03:31:23,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:31:22" (2/3) ... [2023-12-25 03:31:23,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f68fc4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:31:23, skipping insertion in model container [2023-12-25 03:31:23,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:31:23" (3/3) ... [2023-12-25 03:31:23,035 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound2.c [2023-12-25 03:31:23,049 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:31:23,050 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:31:23,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:31:23,088 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;@3df58d99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:31:23,089 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:31:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 03:31:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 03:31:23,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:31:23,099 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:23,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:31:23,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:31:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2023-12-25 03:31:23,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:31:23,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949571810] [2023-12-25 03:31:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:23,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:23,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:31:23,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:31:23,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 03:31:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:23,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:31:23,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 03:31:23,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:31:23,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:31:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949571810] [2023-12-25 03:31:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949571810] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:31:23,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:31:23,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:31:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724789083] [2023-12-25 03:31:23,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:31:23,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:31:23,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:31:23,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:31:23,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:31:23,247 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 03:31:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:31:23,292 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2023-12-25 03:31:23,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:31:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 03:31:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:31:23,299 INFO L225 Difference]: With dead ends: 58 [2023-12-25 03:31:23,299 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 03:31:23,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:31:23,306 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:31:23,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:31:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 03:31:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-25 03:31:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:31:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-25 03:31:23,346 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2023-12-25 03:31:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:31:23,346 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-25 03:31:23,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 03:31:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-25 03:31:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 03:31:23,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:31:23,349 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:23,352 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 03:31:23,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:23,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:31:23,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:31:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2023-12-25 03:31:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:31:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461264457] [2023-12-25 03:31:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:23,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:23,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:31:23,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:31:23,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 03:31:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:23,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:31:23,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:31:23,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:31:23,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:31:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461264457] [2023-12-25 03:31:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461264457] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:31:23,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:31:23,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:31:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956030016] [2023-12-25 03:31:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:31:23,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:31:23,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:31:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:31:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:31:23,658 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:31:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:31:23,750 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2023-12-25 03:31:23,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:31:23,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-25 03:31:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:31:23,752 INFO L225 Difference]: With dead ends: 41 [2023-12-25 03:31:23,752 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 03:31:23,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:31:23,781 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:31:23,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:31:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 03:31:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-25 03:31:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:31:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-25 03:31:23,791 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2023-12-25 03:31:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:31:23,800 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-25 03:31:23,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:31:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-25 03:31:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 03:31:23,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:31:23,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:23,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 03:31:24,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:24,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:31:24,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:31:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2023-12-25 03:31:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:31:24,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667083255] [2023-12-25 03:31:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:24,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:24,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:31:24,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:31:24,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 03:31:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:24,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:31:24,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:31:24,078 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:31:24,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:31:24,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667083255] [2023-12-25 03:31:24,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667083255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:31:24,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:31:24,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:31:24,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157488326] [2023-12-25 03:31:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:31:24,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:31:24,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:31:24,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:31:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:31:24,083 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 03:31:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:31:24,241 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-25 03:31:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:31:24,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-25 03:31:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:31:24,243 INFO L225 Difference]: With dead ends: 45 [2023-12-25 03:31:24,243 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 03:31:24,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 03:31:24,244 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:31:24,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:31:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 03:31:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2023-12-25 03:31:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:31:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2023-12-25 03:31:24,253 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2023-12-25 03:31:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:31:24,253 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-12-25 03:31:24,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 03:31:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2023-12-25 03:31:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 03:31:24,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:31:24,254 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:24,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 03:31:24,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:24,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:31:24,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:31:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2023-12-25 03:31:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:31:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90105502] [2023-12-25 03:31:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:24,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:24,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:31:24,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:31:24,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 03:31:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:24,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 03:31:24,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 03:31:24,672 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:31:24,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:31:24,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90105502] [2023-12-25 03:31:24,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90105502] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:31:24,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:31:24,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 03:31:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126375235] [2023-12-25 03:31:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:31:24,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 03:31:24,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:31:24,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 03:31:24,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 03:31:24,675 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 03:31:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:31:24,945 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2023-12-25 03:31:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 03:31:24,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2023-12-25 03:31:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:31:24,947 INFO L225 Difference]: With dead ends: 64 [2023-12-25 03:31:24,947 INFO L226 Difference]: Without dead ends: 50 [2023-12-25 03:31:24,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:31:24,949 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:31:24,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 137 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 03:31:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-25 03:31:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-25 03:31:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 03:31:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2023-12-25 03:31:24,962 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 33 [2023-12-25 03:31:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:31:24,962 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2023-12-25 03:31:24,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 03:31:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2023-12-25 03:31:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 03:31:24,964 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:31:24,964 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:24,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 03:31:25,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:25,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:31:25,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:31:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2023-12-25 03:31:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:31:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548606221] [2023-12-25 03:31:25,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:25,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:25,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:31:25,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:31:25,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 03:31:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:25,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 03:31:25,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 03:31:25,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:31:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 03:31:26,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:31:26,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548606221] [2023-12-25 03:31:26,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548606221] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:31:26,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:31:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 03:31:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711067285] [2023-12-25 03:31:26,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:31:26,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:31:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:31:26,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:31:26,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 03:31:26,009 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 03:31:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:31:26,438 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2023-12-25 03:31:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:31:26,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2023-12-25 03:31:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:31:26,441 INFO L225 Difference]: With dead ends: 63 [2023-12-25 03:31:26,441 INFO L226 Difference]: Without dead ends: 61 [2023-12-25 03:31:26,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 03:31:26,443 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 03:31:26,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 03:31:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-25 03:31:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-12-25 03:31:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 03:31:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2023-12-25 03:31:26,460 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 40 [2023-12-25 03:31:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:31:26,460 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2023-12-25 03:31:26,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 03:31:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2023-12-25 03:31:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 03:31:26,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:31:26,462 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:26,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 03:31:26,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:26,676 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:31:26,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:31:26,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2023-12-25 03:31:26,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:31:26,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676711195] [2023-12-25 03:31:26,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:26,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:26,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:31:26,678 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:31:26,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 03:31:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:26,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 03:31:26,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-25 03:31:26,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:31:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-25 03:31:27,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:31:27,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676711195] [2023-12-25 03:31:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676711195] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:31:27,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:31:27,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-25 03:31:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479548878] [2023-12-25 03:31:27,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:31:27,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 03:31:27,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:31:27,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 03:31:27,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-25 03:31:27,733 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:31:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:31:28,113 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2023-12-25 03:31:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:31:28,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2023-12-25 03:31:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:31:28,115 INFO L225 Difference]: With dead ends: 71 [2023-12-25 03:31:28,115 INFO L226 Difference]: Without dead ends: 69 [2023-12-25 03:31:28,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-25 03:31:28,116 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:31:28,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 03:31:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-25 03:31:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-12-25 03:31:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 03:31:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2023-12-25 03:31:28,147 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 50 [2023-12-25 03:31:28,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:31:28,148 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2023-12-25 03:31:28,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 03:31:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2023-12-25 03:31:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 03:31:28,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:31:28,152 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:28,159 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 03:31:28,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:28,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:31:28,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:31:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash 769340106, now seen corresponding path program 1 times [2023-12-25 03:31:28,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:31:28,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103141060] [2023-12-25 03:31:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:28,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:28,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:31:28,363 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:31:28,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 03:31:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:28,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 03:31:28,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-25 03:31:28,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:31:28,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:31:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103141060] [2023-12-25 03:31:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103141060] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:31:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [7184166] [2023-12-25 03:31:28,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:28,891 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:31:28,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:31:28,950 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:31:28,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-25 03:31:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:29,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 03:31:29,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:31:29,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:31:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:31:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [7184166] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:31:30,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 03:31:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2023-12-25 03:31:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365904724] [2023-12-25 03:31:30,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 03:31:30,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 03:31:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:31:30,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 03:31:30,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-25 03:31:30,315 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-25 03:31:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:31:31,348 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2023-12-25 03:31:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 03:31:31,348 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 51 [2023-12-25 03:31:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:31:31,350 INFO L225 Difference]: With dead ends: 74 [2023-12-25 03:31:31,350 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 03:31:31,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-12-25 03:31:31,352 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 03:31:31,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 175 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 03:31:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 03:31:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2023-12-25 03:31:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 42 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-25 03:31:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2023-12-25 03:31:31,365 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 51 [2023-12-25 03:31:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:31:31,365 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2023-12-25 03:31:31,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-25 03:31:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2023-12-25 03:31:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 03:31:31,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:31:31,367 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:31:31,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-25 03:31:31,572 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 03:31:31,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:31,770 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:31:31,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:31:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2023-12-25 03:31:31,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:31:31,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767035412] [2023-12-25 03:31:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:31:31,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:31:31,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:31:31,776 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:31:31,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 03:31:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:31:31,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 03:31:31,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:31:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 03:31:32,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:31:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 03:31:37,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:31:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767035412] [2023-12-25 03:31:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767035412] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:31:37,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:31:37,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2023-12-25 03:31:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523300578] [2023-12-25 03:31:37,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:31:37,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 03:31:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:31:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 03:31:37,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-12-25 03:31:37,462 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 11 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 10 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-25 03:31:44,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:31:48,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:32:06,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:32:10,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:32:19,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:32:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:32:31,849 INFO L93 Difference]: Finished difference Result 192 states and 270 transitions. [2023-12-25 03:32:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 03:32:31,855 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 11 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 10 states have call predecessors, (22), 9 states have call successors, (22) Word has length 70 [2023-12-25 03:32:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:32:31,857 INFO L225 Difference]: With dead ends: 192 [2023-12-25 03:32:31,857 INFO L226 Difference]: Without dead ends: 165 [2023-12-25 03:32:31,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=228, Invalid=826, Unknown=2, NotChecked=0, Total=1056 [2023-12-25 03:32:31,862 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 132 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 135 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2023-12-25 03:32:31,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 345 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 421 Invalid, 3 Unknown, 0 Unchecked, 23.9s Time] [2023-12-25 03:32:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-25 03:32:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2023-12-25 03:32:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 77 states have internal predecessors, (85), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-25 03:32:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 168 transitions. [2023-12-25 03:32:31,921 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 168 transitions. Word has length 70 [2023-12-25 03:32:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:32:31,922 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 168 transitions. [2023-12-25 03:32:31,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 11 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 10 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-25 03:32:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 168 transitions. [2023-12-25 03:32:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 03:32:31,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:32:31,923 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:32:31,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-25 03:32:32,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:32:32,124 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:32:32,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:32:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times [2023-12-25 03:32:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:32:32,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998673107] [2023-12-25 03:32:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:32,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:32:32,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:32:32,126 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:32:32,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 03:32:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:32,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 03:32:32,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 65 proven. 27 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-25 03:32:33,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:32:35,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:32:35,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998673107] [2023-12-25 03:32:35,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998673107] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:32:35,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1424746065] [2023-12-25 03:32:35,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:32:35,247 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:32:35,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:32:35,257 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:32:35,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-25 03:32:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:32:35,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 03:32:35,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:32:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 65 proven. 27 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-25 03:32:35,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:33:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 65 proven. 27 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-25 03:33:19,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1424746065] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:33:19,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 03:33:19,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 25 [2023-12-25 03:33:19,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80495899] [2023-12-25 03:33:19,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 03:33:19,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 03:33:19,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:33:19,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 03:33:19,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=536, Unknown=5, NotChecked=0, Total=650 [2023-12-25 03:33:19,741 INFO L87 Difference]: Start difference. First operand 126 states and 168 transitions. Second operand has 25 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 20 states have internal predecessors, (47), 15 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 15 states have call predecessors, (33), 13 states have call successors, (33) [2023-12-25 03:33:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:33:34,900 INFO L93 Difference]: Finished difference Result 170 states and 220 transitions. [2023-12-25 03:33:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 03:33:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 20 states have internal predecessors, (47), 15 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 15 states have call predecessors, (33), 13 states have call successors, (33) Word has length 81 [2023-12-25 03:33:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:33:34,911 INFO L225 Difference]: With dead ends: 170 [2023-12-25 03:33:34,911 INFO L226 Difference]: Without dead ends: 129 [2023-12-25 03:33:34,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 49.4s TimeCoverageRelationStatistics Valid=238, Invalid=1089, Unknown=5, NotChecked=0, Total=1332 [2023-12-25 03:33:34,914 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-12-25 03:33:34,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 320 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-12-25 03:33:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-25 03:33:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2023-12-25 03:33:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 75 states have internal predecessors, (83), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-25 03:33:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2023-12-25 03:33:34,950 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 81 [2023-12-25 03:33:34,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:33:34,950 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2023-12-25 03:33:34,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 20 states have internal predecessors, (47), 15 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 15 states have call predecessors, (33), 13 states have call successors, (33) [2023-12-25 03:33:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2023-12-25 03:33:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-25 03:33:34,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:33:34,955 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:33:34,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 03:33:35,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-12-25 03:33:35,360 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 03:33:35,361 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:33:35,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:33:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1271237959, now seen corresponding path program 1 times [2023-12-25 03:33:35,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:33:35,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24752585] [2023-12-25 03:33:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:33:35,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:33:35,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:33:35,363 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:33:35,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 03:33:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:33:35,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 03:33:35,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:33:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2023-12-25 03:33:35,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:33:35,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:33:35,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24752585] [2023-12-25 03:33:35,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24752585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:33:35,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:33:35,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 03:33:35,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623582345] [2023-12-25 03:33:35,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:33:35,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 03:33:35,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:33:35,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 03:33:35,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:33:35,534 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-25 03:33:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:33:35,909 INFO L93 Difference]: Finished difference Result 135 states and 171 transitions. [2023-12-25 03:33:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 03:33:35,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 90 [2023-12-25 03:33:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:33:35,911 INFO L225 Difference]: With dead ends: 135 [2023-12-25 03:33:35,911 INFO L226 Difference]: Without dead ends: 123 [2023-12-25 03:33:35,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:33:35,912 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:33:35,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 03:33:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-25 03:33:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-12-25 03:33:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 75 states have internal predecessors, (83), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-25 03:33:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2023-12-25 03:33:35,942 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 90 [2023-12-25 03:33:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:33:35,943 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2023-12-25 03:33:35,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-25 03:33:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2023-12-25 03:33:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 03:33:35,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:33:35,944 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:33:35,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 03:33:36,149 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 03:33:36,150 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:33:36,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:33:36,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2133848541, now seen corresponding path program 2 times [2023-12-25 03:33:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:33:36,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363913881] [2023-12-25 03:33:36,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:33:36,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:33:36,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:33:36,152 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 03:33:36,153 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 03:33:36,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:33:36,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:33:36,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 03:33:36,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:33:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-25 03:33:37,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:33:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-12-25 03:33:39,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:33:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363913881] [2023-12-25 03:33:39,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363913881] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:33:39,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:33:39,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2023-12-25 03:33:39,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871584088] [2023-12-25 03:33:39,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:33:39,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 03:33:39,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:33:39,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 03:33:39,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2023-12-25 03:33:39,892 INFO L87 Difference]: Start difference. First operand 123 states and 158 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 16 states have internal predecessors, (41), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 13 states have call predecessors, (30), 12 states have call successors, (30) [2023-12-25 03:33:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:33:46,541 INFO L93 Difference]: Finished difference Result 228 states and 319 transitions. [2023-12-25 03:33:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 03:33:46,545 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 16 states have internal predecessors, (41), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 13 states have call predecessors, (30), 12 states have call successors, (30) Word has length 92 [2023-12-25 03:33:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:33:46,547 INFO L225 Difference]: With dead ends: 228 [2023-12-25 03:33:46,547 INFO L226 Difference]: Without dead ends: 195 [2023-12-25 03:33:46,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 03:33:46,548 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 174 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:33:46,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 490 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-25 03:33:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-25 03:33:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2023-12-25 03:33:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 101 states have (on average 1.198019801980198) internal successors, (121), 108 states have internal predecessors, (121), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-25 03:33:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2023-12-25 03:33:46,592 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 239 transitions. Word has length 92 [2023-12-25 03:33:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:33:46,592 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 239 transitions. [2023-12-25 03:33:46,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 16 states have internal predecessors, (41), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (30), 13 states have call predecessors, (30), 12 states have call successors, (30) [2023-12-25 03:33:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2023-12-25 03:33:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 03:33:46,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:33:46,593 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:33:46,598 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 03:33:46,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:33:46,794 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:33:46,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:33:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1209712204, now seen corresponding path program 3 times [2023-12-25 03:33:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:33:46,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727196846] [2023-12-25 03:33:46,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:33:46,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:33:46,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:33:46,796 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:33:46,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 03:33:46,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 03:33:46,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:33:46,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 03:33:46,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:33:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 66 proven. 20 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-12-25 03:33:48,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:33:50,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:33:50,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727196846] [2023-12-25 03:33:50,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727196846] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:33:50,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1598593365] [2023-12-25 03:33:50,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:33:50,485 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:33:50,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:33:50,485 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:33:50,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-25 03:33:50,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 03:33:50,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:33:50,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 03:33:50,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:33:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2023-12-25 03:33:52,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:33:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2023-12-25 03:33:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1598593365] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:33:54,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 03:33:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 29 [2023-12-25 03:33:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022774001] [2023-12-25 03:33:54,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 03:33:54,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 03:33:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:33:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 03:33:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 03:33:54,081 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 25 states have internal predecessors, (57), 16 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) [2023-12-25 03:33:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:33:56,419 INFO L93 Difference]: Finished difference Result 225 states and 300 transitions. [2023-12-25 03:33:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 03:33:56,423 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 25 states have internal predecessors, (57), 16 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) Word has length 100 [2023-12-25 03:33:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:33:56,424 INFO L225 Difference]: With dead ends: 225 [2023-12-25 03:33:56,424 INFO L226 Difference]: Without dead ends: 108 [2023-12-25 03:33:56,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=247, Invalid=1475, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 03:33:56,425 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 47 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:33:56,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 255 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 03:33:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-25 03:33:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2023-12-25 03:33:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 28 states have call successors, (28), 11 states have call predecessors, (28), 11 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-25 03:33:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2023-12-25 03:33:56,452 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 100 [2023-12-25 03:33:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:33:56,453 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2023-12-25 03:33:56,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 25 states have internal predecessors, (57), 16 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) [2023-12-25 03:33:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2023-12-25 03:33:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 03:33:56,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:33:56,454 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:33:56,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2023-12-25 03:33:56,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 03:33:56,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:33:56,861 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:33:56,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:33:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash -663832148, now seen corresponding path program 1 times [2023-12-25 03:33:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:33:56,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345411931] [2023-12-25 03:33:56,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:33:56,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:33:56,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:33:56,863 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:33:56,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 03:33:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:33:56,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 03:33:56,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:33:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 94 proven. 42 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2023-12-25 03:33:58,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:34:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 94 proven. 42 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2023-12-25 03:34:21,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:34:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345411931] [2023-12-25 03:34:21,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345411931] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:34:21,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:34:21,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 30 [2023-12-25 03:34:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147521039] [2023-12-25 03:34:21,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:34:21,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-25 03:34:21,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:34:21,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-25 03:34:21,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2023-12-25 03:34:21,737 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 23 states have internal predecessors, (52), 15 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (36), 16 states have call predecessors, (36), 15 states have call successors, (36) [2023-12-25 03:34:47,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:34:51,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:07,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:10,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:23,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:33,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:37,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:44,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:35:48,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:01,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:05,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:09,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:13,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:17,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:36:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:17,789 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2023-12-25 03:36:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 03:36:17,810 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 23 states have internal predecessors, (52), 15 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (36), 16 states have call predecessors, (36), 15 states have call successors, (36) Word has length 111 [2023-12-25 03:36:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:17,811 INFO L225 Difference]: With dead ends: 135 [2023-12-25 03:36:17,811 INFO L226 Difference]: Without dead ends: 133 [2023-12-25 03:36:17,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 63.5s TimeCoverageRelationStatistics Valid=521, Invalid=2341, Unknown=0, NotChecked=0, Total=2862 [2023-12-25 03:36:17,813 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 83 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 111 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:17,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 480 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 595 Invalid, 13 Unknown, 0 Unchecked, 66.3s Time] [2023-12-25 03:36:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-25 03:36:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2023-12-25 03:36:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 81 states have internal predecessors, (91), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 03:36:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2023-12-25 03:36:17,848 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 111 [2023-12-25 03:36:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:17,849 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2023-12-25 03:36:17,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 23 states have internal predecessors, (52), 15 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (36), 16 states have call predecessors, (36), 15 states have call successors, (36) [2023-12-25 03:36:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2023-12-25 03:36:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-25 03:36:17,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:17,850 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:17,856 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 03:36:18,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:18,051 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:18,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:18,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1914762232, now seen corresponding path program 1 times [2023-12-25 03:36:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:18,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887266978] [2023-12-25 03:36:18,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:18,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:18,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:18,053 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:18,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 03:36:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:18,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 03:36:18,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2023-12-25 03:36:18,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:36:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2023-12-25 03:36:18,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887266978] [2023-12-25 03:36:18,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887266978] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:36:18,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:36:18,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 9 [2023-12-25 03:36:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881534197] [2023-12-25 03:36:18,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:36:18,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 03:36:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:18,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 03:36:18,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 03:36:18,540 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 9 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) [2023-12-25 03:36:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:18,888 INFO L93 Difference]: Finished difference Result 148 states and 177 transitions. [2023-12-25 03:36:18,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:36:18,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 9 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) Word has length 113 [2023-12-25 03:36:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:18,894 INFO L225 Difference]: With dead ends: 148 [2023-12-25 03:36:18,894 INFO L226 Difference]: Without dead ends: 93 [2023-12-25 03:36:18,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 03:36:18,895 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:18,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 206 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 03:36:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-25 03:36:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-25 03:36:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.0) internal successors, (59), 59 states have internal predecessors, (59), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 03:36:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2023-12-25 03:36:18,913 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 113 [2023-12-25 03:36:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:18,914 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2023-12-25 03:36:18,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 9 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) [2023-12-25 03:36:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2023-12-25 03:36:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-25 03:36:18,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:18,915 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:18,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 03:36:19,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:19,122 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:19,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash 683583031, now seen corresponding path program 1 times [2023-12-25 03:36:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:19,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127589549] [2023-12-25 03:36:19,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:19,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:19,124 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:19,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 03:36:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:19,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 03:36:19,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 96 proven. 48 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2023-12-25 03:36:20,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:36:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 99 proven. 51 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2023-12-25 03:36:34,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127589549] [2023-12-25 03:36:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127589549] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:36:34,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:36:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 32 [2023-12-25 03:36:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96984786] [2023-12-25 03:36:34,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:36:34,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 03:36:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 03:36:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2023-12-25 03:36:34,644 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 24 states have internal predecessors, (54), 16 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (38), 17 states have call predecessors, (38), 16 states have call successors, (38) [2023-12-25 03:36:39,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:39,840 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2023-12-25 03:36:39,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 03:36:39,841 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 24 states have internal predecessors, (54), 16 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (38), 17 states have call predecessors, (38), 16 states have call successors, (38) Word has length 116 [2023-12-25 03:36:39,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:39,841 INFO L225 Difference]: With dead ends: 93 [2023-12-25 03:36:39,841 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 03:36:39,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 03:36:39,843 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:39,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 448 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-25 03:36:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 03:36:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 03:36:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:36:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 03:36:39,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2023-12-25 03:36:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:39,844 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 03:36:39,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 24 states have internal predecessors, (54), 16 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (38), 17 states have call predecessors, (38), 16 states have call successors, (38) [2023-12-25 03:36:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 03:36:39,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 03:36:39,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:36:39,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 03:36:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:40,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 03:36:48,871 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))) [2023-12-25 03:36:48,871 INFO L899 garLoopResultBuilder]: For program point L48(lines 46 58) no Hoare annotation was computed. [2023-12-25 03:36:48,871 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse0 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32))) (.cse3 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse4 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse5 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32)))) (or (and (= .cse0 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse3 .cse4 .cse5) (let ((.cse6 (bvmul (_ bv4 32) |ULTIMATE.start_main_~B~0#1|))) (and .cse2 (bvuge |ULTIMATE.start_main_~r~0#1| .cse0) .cse3 .cse4 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| (bvneg |ULTIMATE.start_main_~d~0#1|) .cse6)) (= |ULTIMATE.start_main_~d~0#1| .cse6) (= (_ bv4 32) |ULTIMATE.start_main_~p~0#1|) .cse5)) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) .cse1 .cse2 .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:36:48,871 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-12-25 03:36:48,871 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32)) [2023-12-25 03:36:48,871 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32))) [2023-12-25 03:36:48,871 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32))) (.cse3 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse4 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse5 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32)))) (or (and (= .cse0 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse3 .cse4 .cse5) (let ((.cse6 (bvmul (_ bv4 32) |ULTIMATE.start_main_~B~0#1|))) (and .cse2 (bvuge |ULTIMATE.start_main_~r~0#1| .cse0) .cse3 .cse4 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| (bvneg |ULTIMATE.start_main_~d~0#1|) .cse6)) (= |ULTIMATE.start_main_~d~0#1| .cse6) (= (_ bv4 32) |ULTIMATE.start_main_~p~0#1|) .cse5)) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) .cse1 .cse2 .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:36:48,872 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse0 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32))) (.cse3 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse4 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse5 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32)))) (or (and (= .cse0 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse3 .cse4 .cse5) (let ((.cse6 (bvmul (_ bv4 32) |ULTIMATE.start_main_~B~0#1|))) (and .cse2 (bvuge |ULTIMATE.start_main_~r~0#1| .cse0) .cse3 .cse4 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| (bvneg |ULTIMATE.start_main_~d~0#1|) .cse6)) (= |ULTIMATE.start_main_~d~0#1| .cse6) (= (_ bv4 32) |ULTIMATE.start_main_~p~0#1|) .cse5)) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) .cse1 .cse2 .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:36:48,872 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 03:36:48,872 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-12-25 03:36:48,872 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 57) no Hoare annotation was computed. [2023-12-25 03:36:48,872 INFO L895 garLoopResultBuilder]: At program point L54-2(lines 46 58) the Hoare annotation is: (let ((.cse0 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)))) (let ((.cse4 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse11 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))) (.cse12 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32))) (.cse3 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32))) (.cse6 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse7 (bvneg |ULTIMATE.start_main_~d~0#1|)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| (_ bv2 32))) (.cse16 (= |ULTIMATE.start_main_~A~0#1| (bvadd .cse0 |ULTIMATE.start_main_~r~0#1|))) (.cse5 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32))) (.cse8 (bvmul (_ bv4 32) |ULTIMATE.start_main_~B~0#1|))) (or (and (not (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (= .cse0 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (bvuge |ULTIMATE.start_main_~r~0#1| .cse0) .cse4 .cse6 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| .cse7 .cse8)) (= |ULTIMATE.start_main_~d~0#1| .cse8) (= (_ bv4 32) |ULTIMATE.start_main_~p~0#1|) .cse5) (let ((.cse10 (bvneg (bvudiv .cse0 (_ bv2 32))))) (let ((.cse9 (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul (_ bv4294967295 32) .cse10)))) (and (= |ULTIMATE.start_main_~A~0#1| (bvadd .cse0 |ULTIMATE.start_main_~r~0#1| .cse7)) (bvuge .cse9 |ULTIMATE.start_main_~B~0#1|) (not (bvuge .cse9 .cse0)) (= |ULTIMATE.start_main_~r~0#1| (bvadd |ULTIMATE.start_main_~A~0#1| .cse10)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse5 .cse11))) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) .cse12 .cse1 .cse2 .cse6 .cse5 .cse11) (and .cse12 (exists ((|ULTIMATE.start_main_~p~0#1| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (let ((.cse13 (bvudiv (bvmul (_ bv4 32) v_subst_1) (_ bv2 32)))) (let ((.cse14 (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul (bvneg .cse13) (_ bv4294967295 32))))) (and (= |ULTIMATE.start_main_~d~0#1| (bvudiv .cse13 (_ bv2 32))) (bvuge v_subst_1 (_ bv1 32)) (= .cse13 (bvmul |ULTIMATE.start_main_~p~0#1| v_subst_1)) (bvule .cse14 (_ bv2 32)) (bvuge .cse14 (bvmul v_subst_1 (_ bv2 32))) (bvuge .cse14 v_subst_1))))) .cse6 .cse15 .cse16 .cse5 .cse11) (and .cse12 .cse3 .cse6 (bvuge (bvadd (bvmul (_ bv4294967295 32) .cse7) |ULTIMATE.start_main_~r~0#1|) .cse0) .cse15 .cse16 .cse5 (= (bvudiv .cse8 (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|))))) [2023-12-25 03:36:48,873 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse2 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32))) (.cse3 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32))) (.cse4 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)) .cse2 .cse3 .cse4) (and .cse0 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse3 .cse4) (let ((.cse5 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)))) (and (= |ULTIMATE.start_main_~d~0#1| (bvudiv .cse5 (_ bv2 32))) .cse1 (exists ((v_subst_4 (_ BitVec 32))) (and (not (bvuge v_subst_4 |ULTIMATE.start_main_~d~0#1|)) (bvule (bvadd .cse5 v_subst_4) (_ bv2 32)))) (bvule (bvadd .cse5 |ULTIMATE.start_main_~r~0#1|) (_ bv2 32)) (= |ULTIMATE.start_main_~A~0#1| (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~d~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse3 .cse4)))) [2023-12-25 03:36:48,873 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 03:36:48,873 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32))) (.cse3 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse4 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse5 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32)))) (or (and (= .cse0 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32)) .cse3 .cse4 .cse5) (let ((.cse6 (bvmul (_ bv4 32) |ULTIMATE.start_main_~B~0#1|))) (and .cse2 (bvuge |ULTIMATE.start_main_~r~0#1| .cse0) .cse3 .cse4 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| (bvneg |ULTIMATE.start_main_~d~0#1|) .cse6)) (= |ULTIMATE.start_main_~d~0#1| .cse6) (= (_ bv4 32) |ULTIMATE.start_main_~p~0#1|) .cse5)) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) .cse1 .cse2 .cse4 .cse5 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))))) [2023-12-25 03:36:48,873 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2023-12-25 03:36:48,873 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-12-25 03:36:48,874 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)))) (let ((.cse4 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse11 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))) (.cse12 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32))) (.cse3 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32))) (.cse6 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse7 (bvneg |ULTIMATE.start_main_~d~0#1|)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| (_ bv2 32))) (.cse16 (= |ULTIMATE.start_main_~A~0#1| (bvadd .cse0 |ULTIMATE.start_main_~r~0#1|))) (.cse5 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32))) (.cse8 (bvmul (_ bv4 32) |ULTIMATE.start_main_~B~0#1|))) (or (and (not (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (= .cse0 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (bvuge |ULTIMATE.start_main_~r~0#1| .cse0) .cse4 .cse6 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| .cse7 .cse8)) (= |ULTIMATE.start_main_~d~0#1| .cse8) (= (_ bv4 32) |ULTIMATE.start_main_~p~0#1|) .cse5) (let ((.cse10 (bvneg (bvudiv .cse0 (_ bv2 32))))) (let ((.cse9 (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul (_ bv4294967295 32) .cse10)))) (and (= |ULTIMATE.start_main_~A~0#1| (bvadd .cse0 |ULTIMATE.start_main_~r~0#1| .cse7)) (bvuge .cse9 |ULTIMATE.start_main_~B~0#1|) (not (bvuge .cse9 .cse0)) (= |ULTIMATE.start_main_~r~0#1| (bvadd |ULTIMATE.start_main_~A~0#1| .cse10)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse5 .cse11))) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) .cse12 .cse1 .cse2 .cse6 .cse5 .cse11) (and .cse12 (exists ((|ULTIMATE.start_main_~p~0#1| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (let ((.cse13 (bvudiv (bvmul (_ bv4 32) v_subst_1) (_ bv2 32)))) (let ((.cse14 (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul (bvneg .cse13) (_ bv4294967295 32))))) (and (= |ULTIMATE.start_main_~d~0#1| (bvudiv .cse13 (_ bv2 32))) (bvuge v_subst_1 (_ bv1 32)) (= .cse13 (bvmul |ULTIMATE.start_main_~p~0#1| v_subst_1)) (bvule .cse14 (_ bv2 32)) (bvuge .cse14 (bvmul v_subst_1 (_ bv2 32))) (bvuge .cse14 v_subst_1))))) .cse6 .cse15 .cse16 .cse5 .cse11) (and .cse12 .cse3 .cse6 (bvuge (bvadd (bvmul (_ bv4294967295 32) .cse7) |ULTIMATE.start_main_~r~0#1|) .cse0) .cse15 .cse16 .cse5 (= (bvudiv .cse8 (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|))))) [2023-12-25 03:36:48,874 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)))) (let ((.cse4 (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~B~0#1|)) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse11 (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32))) (.cse12 (bvule |ULTIMATE.start_main_~B~0#1| (_ bv2 32))) (.cse3 (= |ULTIMATE.start_main_~p~0#1| (_ bv2 32))) (.cse6 (bvuge |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse7 (bvneg |ULTIMATE.start_main_~d~0#1|)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| (_ bv2 32))) (.cse16 (= |ULTIMATE.start_main_~A~0#1| (bvadd .cse0 |ULTIMATE.start_main_~r~0#1|))) (.cse5 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv2 32))) (.cse8 (bvmul (_ bv4 32) |ULTIMATE.start_main_~B~0#1|))) (or (and (not (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~d~0#1|)) (= .cse0 |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (bvuge |ULTIMATE.start_main_~r~0#1| .cse0) .cse4 .cse6 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| .cse7 .cse8)) (= |ULTIMATE.start_main_~d~0#1| .cse8) (= (_ bv4 32) |ULTIMATE.start_main_~p~0#1|) .cse5) (let ((.cse10 (bvneg (bvudiv .cse0 (_ bv2 32))))) (let ((.cse9 (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul (_ bv4294967295 32) .cse10)))) (and (= |ULTIMATE.start_main_~A~0#1| (bvadd .cse0 |ULTIMATE.start_main_~r~0#1| .cse7)) (bvuge .cse9 |ULTIMATE.start_main_~B~0#1|) (not (bvuge .cse9 .cse0)) (= |ULTIMATE.start_main_~r~0#1| (bvadd |ULTIMATE.start_main_~A~0#1| .cse10)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse5 .cse11))) (and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) .cse12 .cse1 .cse2 .cse6 .cse5 .cse11) (and .cse12 (exists ((|ULTIMATE.start_main_~p~0#1| (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (let ((.cse13 (bvudiv (bvmul (_ bv4 32) v_subst_1) (_ bv2 32)))) (let ((.cse14 (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul (bvneg .cse13) (_ bv4294967295 32))))) (and (= |ULTIMATE.start_main_~d~0#1| (bvudiv .cse13 (_ bv2 32))) (bvuge v_subst_1 (_ bv1 32)) (= .cse13 (bvmul |ULTIMATE.start_main_~p~0#1| v_subst_1)) (bvule .cse14 (_ bv2 32)) (bvuge .cse14 (bvmul v_subst_1 (_ bv2 32))) (bvuge .cse14 v_subst_1))))) .cse6 .cse15 .cse16 .cse5 .cse11) (and .cse12 .cse3 .cse6 (bvuge (bvadd (bvmul (_ bv4294967295 32) .cse7) |ULTIMATE.start_main_~r~0#1|) .cse0) .cse15 .cse16 .cse5 (= (bvudiv .cse8 (_ bv2 32)) |ULTIMATE.start_main_~d~0#1|))))) [2023-12-25 03:36:48,874 INFO L899 garLoopResultBuilder]: For program point L39(lines 36 44) no Hoare annotation was computed. [2023-12-25 03:36:48,874 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-12-25 03:36:48,874 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-12-25 03:36:48,874 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-12-25 03:36:48,874 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-12-25 03:36:48,874 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-12-25 03:36:48,874 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-12-25 03:36:48,875 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-12-25 03:36:48,875 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-12-25 03:36:48,875 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-12-25 03:36:48,875 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-12-25 03:36:48,877 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:48,879 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:36:48,905 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~p~0#1 : bv32, v_subst_1 : bv32 :: ((((~d~0 == ~bvudiv~32(~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32), 2bv32) && ~bvuge~32(v_subst_1, 1bv32)) && ~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32) == ~bvmul~32(ULTIMATE.start_main_~p~0#1, v_subst_1)) && ~bvule~32(~bvadd~32(~r~0, ~bvmul~32(~bvneg~32(~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32)), 4294967295bv32)), 2bv32)) && ~bvuge~32(~bvadd~32(~r~0, ~bvmul~32(~bvneg~32(~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32)), 4294967295bv32)), ~bvmul~32(v_subst_1, 2bv32))) && ~bvuge~32(~bvadd~32(~r~0, ~bvmul~32(~bvneg~32(~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32)), 4294967295bv32)), v_subst_1)) could not be translated [2023-12-25 03:36:48,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:36:48 BoogieIcfgContainer [2023-12-25 03:36:48,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:36:48,915 INFO L158 Benchmark]: Toolchain (without parser) took 326556.24ms. Allocated memory was 179.3MB in the beginning and 238.0MB in the end (delta: 58.7MB). Free memory was 137.7MB in the beginning and 75.6MB in the end (delta: 62.1MB). Peak memory consumption was 128.4MB. Max. memory is 8.0GB. [2023-12-25 03:36:48,915 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 179.3MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:36:48,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.00ms. Allocated memory is still 179.3MB. Free memory was 137.7MB in the beginning and 126.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 03:36:48,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.16ms. Allocated memory is still 179.3MB. Free memory was 126.1MB in the beginning and 124.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:36:48,916 INFO L158 Benchmark]: Boogie Preprocessor took 35.85ms. Allocated memory is still 179.3MB. Free memory was 124.4MB in the beginning and 122.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 03:36:48,916 INFO L158 Benchmark]: RCFGBuilder took 382.63ms. Allocated memory is still 179.3MB. Free memory was 122.7MB in the beginning and 110.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 03:36:48,916 INFO L158 Benchmark]: TraceAbstraction took 325884.62ms. Allocated memory was 179.3MB in the beginning and 238.0MB in the end (delta: 58.7MB). Free memory was 109.4MB in the beginning and 75.6MB in the end (delta: 33.8MB). Peak memory consumption was 100.1MB. Max. memory is 8.0GB. [2023-12-25 03:36:48,917 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.47ms. Allocated memory is still 179.3MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.00ms. Allocated memory is still 179.3MB. Free memory was 137.7MB in the beginning and 126.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.16ms. Allocated memory is still 179.3MB. Free memory was 126.1MB in the beginning and 124.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.85ms. Allocated memory is still 179.3MB. Free memory was 124.4MB in the beginning and 122.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 382.63ms. Allocated memory is still 179.3MB. Free memory was 122.7MB in the beginning and 110.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 325884.62ms. Allocated memory was 179.3MB in the beginning and 238.0MB in the end (delta: 58.7MB). Free memory was 109.4MB in the beginning and 75.6MB in the end (delta: 33.8MB). Peak memory consumption was 100.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~p~0#1 : bv32, v_subst_1 : bv32 :: ((((~d~0 == ~bvudiv~32(~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32), 2bv32) && ~bvuge~32(v_subst_1, 1bv32)) && ~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32) == ~bvmul~32(ULTIMATE.start_main_~p~0#1, v_subst_1)) && ~bvule~32(~bvadd~32(~r~0, ~bvmul~32(~bvneg~32(~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32)), 4294967295bv32)), 2bv32)) && ~bvuge~32(~bvadd~32(~r~0, ~bvmul~32(~bvneg~32(~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32)), 4294967295bv32)), ~bvmul~32(v_subst_1, 2bv32))) && ~bvuge~32(~bvadd~32(~r~0, ~bvmul~32(~bvneg~32(~bvudiv~32(~bvmul~32(4bv32, v_subst_1), 2bv32)), 4294967295bv32)), v_subst_1)) could not be translated * 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 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 325.8s, OverallIterations: 15, TraceHistogramMax: 17, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 203.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 666 SdHoareTripleChecker+Valid, 107.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 613 mSDsluCounter, 3426 SdHoareTripleChecker+Invalid, 103.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2903 mSDsCounter, 664 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2998 IncrementalHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 664 mSolverCounterUnsat, 523 mSDtfsCounter, 2998 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2178 GetRequests, 1875 SyntacticMatches, 5 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 171.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=11, InterpolantAutomatonStates: 188, 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, 15 MinimizatonAttempts, 97 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 140 PreInvPairs, 183 NumberOfFragments, 1234 HoareAnnotationTreeSize, 140 FormulaSimplifications, 151533 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 14 FormulaSimplificationsInter, 1898 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 108.1s InterpolantComputationTime, 1253 NumberOfCodeBlocks, 1199 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2049 ConstructedInterpolants, 44 QuantifiedInterpolants, 10719 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1955 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 6113/6546 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((((!((r >= d)) && ((B * 2) == d)) && (r == A)) && (q == 0)) && (p == 2)) && (r >= B)) && (A <= 2)) || ((((((((q == 0) && (r >= (B * 2))) && (r >= B)) && (B >= 1)) && (A == ((r + -(d)) % 4294967296))) && (d == (4 * B))) && (4 == p)) && (A <= 2))) || (((((((A == (((B * 2) + r) % 4294967296)) && (((r + (-1 * -(((B * 2) / 2)))) % 4294967296) >= B)) && !((((r + (-1 * -(((B * 2) / 2)))) % 4294967296) >= (B * 2)))) && (r == ((A + -(((B * 2) / 2))) % 4294967296))) && (q == 1)) && (A <= 2)) && (p == 1))) || (((((((d == B) && (B <= 2)) && (r == A)) && (q == 0)) && (B >= 1)) && (A <= 2)) && (p == 1))) || ((((((B <= 2) && (B >= 1)) && (q == 2)) && (A == (((B * 2) + r) % 4294967296))) && (A <= 2)) && (p == 1))) || ((((((((B <= 2) && (p == 2)) && (B >= 1)) && ((((-1 * -(d)) + r) % 4294967296) >= (B * 2))) && (q == 2)) && (A == (((B * 2) + r) % 4294967296))) && (A <= 2)) && (((4 * B) / 2) == d))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((B * 2) == d) && (r == A)) && (q == 0)) && (p == 2)) && (r >= B)) && (B >= 1)) && (A <= 2)) || ((((((((q == 0) && (r >= (B * 2))) && (r >= B)) && (B >= 1)) && (A == ((r + -(d)) % 4294967296))) && (d == (4 * B))) && (4 == p)) && (A <= 2))) || (((((((d == B) && (B <= 2)) && (r == A)) && (q == 0)) && (B >= 1)) && (A <= 2)) && (p == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-25 03:36:48,964 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 0 Received shutdown request...