/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:15:47,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:15:47,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 01:15:47,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:15:47,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:15:47,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:15:47,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:15:47,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:15:47,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:15:47,481 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:15:47,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:15:47,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:15:47,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:15:47,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:15:47,483 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:15:47,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:15:47,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:15:47,484 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:15:47,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:15:47,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:15:47,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:15:47,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:15:47,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:15:47,485 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:15:47,486 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:15:47,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:15:47,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:15:47,486 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:15:47,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:15:47,487 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:15:47,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:15:47,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:15:47,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:15:47,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:15:47,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:15:47,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:15:47,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:15:47,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:15:47,489 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:15:47,489 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:15:47,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:15:47,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:15:47,500 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:15:47,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:15:47,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:15:47,501 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:15:47,501 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 01:15:47,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:15:47,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:15:47,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:15:47,650 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:15:47,650 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:15:47,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i [2023-12-25 01:15:48,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:15:48,745 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:15:48,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i [2023-12-25 01:15:48,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc250606/f2f2f013fcad43188256b18d09fa1da0/FLAG1e783f4af [2023-12-25 01:15:48,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc250606/f2f2f013fcad43188256b18d09fa1da0 [2023-12-25 01:15:48,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:15:48,776 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:15:48,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:15:48,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:15:48,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:15:48,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:48,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b68d0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48, skipping insertion in model container [2023-12-25 01:15:48,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:48,796 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:15:48,911 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i[951,964] [2023-12-25 01:15:48,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:15:48,929 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:15:48,937 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i[951,964] [2023-12-25 01:15:48,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:15:48,950 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:15:48,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48 WrapperNode [2023-12-25 01:15:48,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:15:48,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:15:48,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:15:48,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:15:48,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:48,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:48,979 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2023-12-25 01:15:48,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:15:48,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:15:48,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:15:48,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:15:48,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:48,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:48,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:49,000 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 01:15:49,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:49,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:49,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:49,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:49,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:49,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:49,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:15:49,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:15:49,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:15:49,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:15:49,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (1/1) ... [2023-12-25 01:15:49,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:15:49,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:15:49,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 01:15:49,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 01:15:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:15:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:15:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:15:49,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:15:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:15:49,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:15:49,095 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:15:49,097 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:15:49,200 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:15:49,229 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:15:49,229 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:15:49,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:15:49 BoogieIcfgContainer [2023-12-25 01:15:49,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:15:49,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:15:49,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:15:49,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:15:49,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:15:48" (1/3) ... [2023-12-25 01:15:49,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a7c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:15:49, skipping insertion in model container [2023-12-25 01:15:49,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:15:48" (2/3) ... [2023-12-25 01:15:49,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a7c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:15:49, skipping insertion in model container [2023-12-25 01:15:49,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:15:49" (3/3) ... [2023-12-25 01:15:49,234 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound5.i [2023-12-25 01:15:49,250 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:15:49,250 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:15:49,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:15:49,289 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;@6f408af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:15:49,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:15:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:15:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 01:15:49,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:49,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:49,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:49,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash 334653711, now seen corresponding path program 1 times [2023-12-25 01:15:49,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:49,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637642062] [2023-12-25 01:15:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:15:49,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:49,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:49,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:15:49,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:15:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:15:49,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:15:49,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:15:49,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:15:49,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:49,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637642062] [2023-12-25 01:15:49,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637642062] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:15:49,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:15:49,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:15:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822731857] [2023-12-25 01:15:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:15:49,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:15:49,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:15:49,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:15:49,389 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:15:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:15:49,405 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2023-12-25 01:15:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:15:49,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-25 01:15:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:15:49,411 INFO L225 Difference]: With dead ends: 34 [2023-12-25 01:15:49,411 INFO L226 Difference]: Without dead ends: 16 [2023-12-25 01:15:49,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:15:49,415 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:49,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:15:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-25 01:15:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-25 01:15:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 01:15:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-25 01:15:49,435 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2023-12-25 01:15:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:15:49,435 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-25 01:15:49,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:15:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-25 01:15:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 01:15:49,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:49,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:49,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 01:15:49,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:49,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:49,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash -401566674, now seen corresponding path program 1 times [2023-12-25 01:15:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822975215] [2023-12-25 01:15:49,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:15:49,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:49,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:15:49,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:15:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:15:49,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:15:49,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:15:49,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:15:49,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:49,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822975215] [2023-12-25 01:15:49,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822975215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:15:49,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:15:49,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 01:15:49,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553106032] [2023-12-25 01:15:49,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:15:49,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:15:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:15:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:15:49,993 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:15:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:15:50,145 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-25 01:15:50,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:15:50,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-25 01:15:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:15:50,147 INFO L225 Difference]: With dead ends: 28 [2023-12-25 01:15:50,147 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 01:15:50,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:15:50,148 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:50,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:15:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 01:15:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-25 01:15:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:15:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-25 01:15:50,156 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2023-12-25 01:15:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:15:50,156 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-25 01:15:50,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:15:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-25 01:15:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 01:15:50,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:50,157 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:50,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 01:15:50,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:50,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:50,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1504476233, now seen corresponding path program 1 times [2023-12-25 01:15:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:50,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859626698] [2023-12-25 01:15:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:15:50,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 01:15:50,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:50,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:15:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:15:50,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:15:50,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:15:50,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:15:50,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:15:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:15:51,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859626698] [2023-12-25 01:15:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859626698] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:15:51,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:15:51,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-12-25 01:15:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728769689] [2023-12-25 01:15:51,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:15:51,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:15:51,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:51,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:15:51,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:15:51,535 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:15:56,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:00,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:01,069 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2023-12-25 01:16:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:16:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-25 01:16:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:01,073 INFO L225 Difference]: With dead ends: 59 [2023-12-25 01:16:01,074 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 01:16:01,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-12-25 01:16:01,075 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:01,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 95 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2023-12-25 01:16:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 01:16:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2023-12-25 01:16:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 01:16:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2023-12-25 01:16:01,085 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 12 [2023-12-25 01:16:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:01,085 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2023-12-25 01:16:01,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:16:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2023-12-25 01:16:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:16:01,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:01,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:01,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 01:16:01,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:01,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:01,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1989427041, now seen corresponding path program 1 times [2023-12-25 01:16:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:01,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740787292] [2023-12-25 01:16:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:16:01,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:01,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:01,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:01,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 01:16:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:16:01,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 01:16:01,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:16:01,339 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:16:01,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:16:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740787292] [2023-12-25 01:16:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740787292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:16:01,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:16:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:16:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985924426] [2023-12-25 01:16:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:16:01,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 01:16:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:16:01,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 01:16:01,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 01:16:01,344 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 01:16:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:01,375 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2023-12-25 01:16:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 01:16:01,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-12-25 01:16:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:01,377 INFO L225 Difference]: With dead ends: 65 [2023-12-25 01:16:01,377 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 01:16:01,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 01:16:01,378 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:01,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:16:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 01:16:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-25 01:16:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:16:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2023-12-25 01:16:01,385 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 18 [2023-12-25 01:16:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:01,385 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2023-12-25 01:16:01,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 01:16:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2023-12-25 01:16:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:16:01,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:01,386 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:01,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 01:16:01,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:01,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:01,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1842785254, now seen corresponding path program 2 times [2023-12-25 01:16:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642524241] [2023-12-25 01:16:01,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:16:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:01,596 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:01,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 01:16:01,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 01:16:01,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:16:01,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 01:16:01,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 01:16:01,761 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:16:01,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:16:01,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642524241] [2023-12-25 01:16:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642524241] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:16:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:16:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 01:16:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971559314] [2023-12-25 01:16:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:16:01,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 01:16:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:16:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 01:16:01,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 01:16:01,764 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:16:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:01,899 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2023-12-25 01:16:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 01:16:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-25 01:16:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:01,902 INFO L225 Difference]: With dead ends: 57 [2023-12-25 01:16:01,902 INFO L226 Difference]: Without dead ends: 54 [2023-12-25 01:16:01,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 01:16:01,903 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:01,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 42 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:16:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-25 01:16:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-12-25 01:16:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:16:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-12-25 01:16:01,912 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 18 [2023-12-25 01:16:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:01,912 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-12-25 01:16:01,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:16:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-12-25 01:16:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 01:16:01,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:01,913 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:01,917 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 (6)] Ended with exit code 0 [2023-12-25 01:16:02,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:02,118 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:02,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash 653827799, now seen corresponding path program 1 times [2023-12-25 01:16:02,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:02,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730460137] [2023-12-25 01:16:02,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:16:02,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:02,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:02,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:02,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:16:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:16:02,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 01:16:02,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:16:02,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:16:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:16:04,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:16:04,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730460137] [2023-12-25 01:16:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730460137] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:16:04,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:16:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 01:16:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865993363] [2023-12-25 01:16:04,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:16:04,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:16:04,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:16:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:16:04,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:16:04,207 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:16:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:09,646 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2023-12-25 01:16:09,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 01:16:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-12-25 01:16:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:09,651 INFO L225 Difference]: With dead ends: 117 [2023-12-25 01:16:09,651 INFO L226 Difference]: Without dead ends: 95 [2023-12-25 01:16:09,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2023-12-25 01:16:09,653 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:09,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 193 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 01:16:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-25 01:16:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2023-12-25 01:16:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 66 states have internal predecessors, (76), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:16:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2023-12-25 01:16:09,688 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 22 [2023-12-25 01:16:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:09,688 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2023-12-25 01:16:09,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:16:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2023-12-25 01:16:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 01:16:09,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:09,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:09,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 01:16:09,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:09,897 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:09,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1620400559, now seen corresponding path program 2 times [2023-12-25 01:16:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532712763] [2023-12-25 01:16:09,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:16:09,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:09,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:09,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 01:16:09,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:16:09,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:16:09,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:16:09,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:16:09,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:16:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:16:10,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:16:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532712763] [2023-12-25 01:16:10,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532712763] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:16:10,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:16:10,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2023-12-25 01:16:10,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558239696] [2023-12-25 01:16:10,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:16:10,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 01:16:10,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:16:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 01:16:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-25 01:16:10,055 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:16:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:10,153 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2023-12-25 01:16:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:16:10,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2023-12-25 01:16:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:10,156 INFO L225 Difference]: With dead ends: 122 [2023-12-25 01:16:10,156 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 01:16:10,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-25 01:16:10,157 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:10,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:16:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 01:16:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-12-25 01:16:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 55 states have internal predecessors, (63), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:16:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2023-12-25 01:16:10,180 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 28 [2023-12-25 01:16:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:10,180 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2023-12-25 01:16:10,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:16:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2023-12-25 01:16:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 01:16:10,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:10,181 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:10,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:16:10,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:10,385 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:10,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 263511235, now seen corresponding path program 3 times [2023-12-25 01:16:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:10,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055484129] [2023-12-25 01:16:10,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:16:10,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:10,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:10,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:10,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 01:16:10,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-25 01:16:10,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:16:10,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:16:10,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 01:16:12,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:16:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 01:16:21,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:16:21,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055484129] [2023-12-25 01:16:21,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055484129] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:16:21,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:16:21,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-25 01:16:21,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948650553] [2023-12-25 01:16:21,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:16:21,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 01:16:21,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:16:21,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 01:16:21,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=236, Unknown=2, NotChecked=0, Total=306 [2023-12-25 01:16:21,588 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:16:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:24,274 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2023-12-25 01:16:24,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:16:24,275 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-12-25 01:16:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:24,276 INFO L225 Difference]: With dead ends: 102 [2023-12-25 01:16:24,276 INFO L226 Difference]: Without dead ends: 98 [2023-12-25 01:16:24,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=98, Invalid=362, Unknown=2, NotChecked=0, Total=462 [2023-12-25 01:16:24,277 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:24,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 147 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 01:16:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-25 01:16:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2023-12-25 01:16:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 01:16:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2023-12-25 01:16:24,298 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 30 [2023-12-25 01:16:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:24,300 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2023-12-25 01:16:24,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:16:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2023-12-25 01:16:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 01:16:24,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:24,302 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:24,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:16:24,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:24,505 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:24,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1673092517, now seen corresponding path program 4 times [2023-12-25 01:16:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:24,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48649317] [2023-12-25 01:16:24,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 01:16:24,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:24,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:24,507 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:24,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 01:16:24,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 01:16:24,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:16:24,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 01:16:24,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:16:24,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:16:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:16:25,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:16:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48649317] [2023-12-25 01:16:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48649317] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:16:25,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:16:25,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-12-25 01:16:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991619469] [2023-12-25 01:16:25,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:16:25,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:16:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:16:25,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:16:25,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:16:25,514 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:16:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:26,441 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2023-12-25 01:16:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 01:16:26,441 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2023-12-25 01:16:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:26,442 INFO L225 Difference]: With dead ends: 121 [2023-12-25 01:16:26,442 INFO L226 Difference]: Without dead ends: 73 [2023-12-25 01:16:26,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2023-12-25 01:16:26,443 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 77 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:26,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 301 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 01:16:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-25 01:16:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2023-12-25 01:16:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:16:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-12-25 01:16:26,454 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 32 [2023-12-25 01:16:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:26,455 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-12-25 01:16:26,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:16:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-12-25 01:16:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 01:16:26,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:26,458 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:26,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-25 01:16:26,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:26,661 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:26,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1730350819, now seen corresponding path program 1 times [2023-12-25 01:16:26,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658015860] [2023-12-25 01:16:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:16:26,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:26,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:26,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:26,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 01:16:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:16:26,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 01:16:26,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:16:27,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:16:39,195 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:16:47,214 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:16:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 01:16:51,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:16:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658015860] [2023-12-25 01:16:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658015860] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:16:51,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:16:51,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2023-12-25 01:16:51,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617662392] [2023-12-25 01:16:51,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:16:51,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 01:16:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:16:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 01:16:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2023-12-25 01:16:51,287 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 21 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:16:58,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:01,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:10,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:14,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:20,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:25,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:29,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:17:29,718 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2023-12-25 01:17:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 01:17:29,734 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 21 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2023-12-25 01:17:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:17:29,735 INFO L225 Difference]: With dead ends: 91 [2023-12-25 01:17:29,735 INFO L226 Difference]: Without dead ends: 83 [2023-12-25 01:17:29,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 01:17:29,736 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 47 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 29 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:17:29,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 191 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 340 Invalid, 5 Unknown, 0 Unchecked, 31.2s Time] [2023-12-25 01:17:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-25 01:17:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2023-12-25 01:17:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 01:17:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2023-12-25 01:17:29,764 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 32 [2023-12-25 01:17:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:17:29,764 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2023-12-25 01:17:29,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 21 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:17:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2023-12-25 01:17:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 01:17:29,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:17:29,765 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 01:17:29,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 01:17:29,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:17:29,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:17:29,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:17:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1670815805, now seen corresponding path program 5 times [2023-12-25 01:17:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:17:29,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648595258] [2023-12-25 01:17:29,969 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 01:17:29,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:17:29,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:17:29,970 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:17:29,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 01:17:30,028 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-25 01:17:30,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:17:30,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:17:30,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:17:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:17:30,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:17:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:17:30,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:17:30,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648595258] [2023-12-25 01:17:30,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648595258] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:17:30,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:17:30,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2023-12-25 01:17:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755147404] [2023-12-25 01:17:30,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:17:30,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 01:17:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:17:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 01:17:30,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:17:30,326 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:17:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:17:30,510 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2023-12-25 01:17:30,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:17:30,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-12-25 01:17:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:17:30,513 INFO L225 Difference]: With dead ends: 80 [2023-12-25 01:17:30,513 INFO L226 Difference]: Without dead ends: 55 [2023-12-25 01:17:30,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:17:30,514 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:17:30,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 01:17:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-25 01:17:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-25 01:17:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 01:17:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-12-25 01:17:30,550 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 38 [2023-12-25 01:17:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:17:30,550 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-12-25 01:17:30,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:17:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-12-25 01:17:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 01:17:30,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:17:30,552 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:17:30,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 01:17:30,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:17:30,757 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:17:30,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:17:30,757 INFO L85 PathProgramCache]: Analyzing trace with hash 888091926, now seen corresponding path program 2 times [2023-12-25 01:17:30,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:17:30,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269522987] [2023-12-25 01:17:30,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:17:30,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:17:30,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:17:30,758 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:17:30,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 01:17:30,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:17:30,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:17:30,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 01:17:30,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:17:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 01:17:31,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:17:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 01:17:40,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:17:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269522987] [2023-12-25 01:17:40,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269522987] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:17:40,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:17:40,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2023-12-25 01:17:40,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619798558] [2023-12-25 01:17:40,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:17:40,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 01:17:40,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:17:40,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 01:17:40,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:17:40,468 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:17:49,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:02,382 WARN L293 SmtUtils]: Spent 10.96s on a formula simplification. DAG size of input: 78 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:18:12,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:16,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:22,865 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 65 DAG size of output: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:18:27,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:30,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:31,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:35,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:41,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:45,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:49,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:55,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:00,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:03,795 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2023-12-25 01:19:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-25 01:19:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2023-12-25 01:19:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:03,805 INFO L225 Difference]: With dead ends: 94 [2023-12-25 01:19:03,805 INFO L226 Difference]: Without dead ends: 92 [2023-12-25 01:19:03,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=332, Invalid=1474, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 01:19:03,806 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 59 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 45 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:03,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 218 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 370 Invalid, 7 Unknown, 0 Unchecked, 45.2s Time] [2023-12-25 01:19:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-25 01:19:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2023-12-25 01:19:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-25 01:19:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2023-12-25 01:19:03,852 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 40 [2023-12-25 01:19:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:03,852 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2023-12-25 01:19:03,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:19:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2023-12-25 01:19:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 01:19:03,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:03,853 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:03,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-25 01:19:04,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:04,056 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:04,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:04,057 INFO L85 PathProgramCache]: Analyzing trace with hash 685209673, now seen corresponding path program 3 times [2023-12-25 01:19:04,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:04,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008326065] [2023-12-25 01:19:04,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:19:04,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:04,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:04,058 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:04,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 01:19:04,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-25 01:19:04,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:19:04,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 01:19:04,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:19:04,550 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:19:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:19:04,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008326065] [2023-12-25 01:19:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008326065] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:19:04,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:19:04,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-25 01:19:04,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016725212] [2023-12-25 01:19:04,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:19:04,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 01:19:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 01:19:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:19:04,942 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:19:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:05,501 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2023-12-25 01:19:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 01:19:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 48 [2023-12-25 01:19:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:05,505 INFO L225 Difference]: With dead ends: 87 [2023-12-25 01:19:05,505 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 01:19:05,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:19:05,507 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:05,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 130 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 01:19:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 01:19:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 01:19:05,508 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 01:19:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 01:19:05,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2023-12-25 01:19:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:05,508 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 01:19:05,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:19:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 01:19:05,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 01:19:05,513 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:19:05,520 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 (14)] Ended with exit code 0 [2023-12-25 01:19:05,722 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 01:19:05,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 01:19:08,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 01:19:08,329 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-12-25 01:19:08,329 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-12-25 01:19:08,329 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 01:19:08,329 INFO L895 garLoopResultBuilder]: At program point L38-1(lines 38 47) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~A~0#1| (_ bv5 32)) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|)) [2023-12-25 01:19:08,329 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 37) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse3 (bvule |ULTIMATE.start_main_~r~0#1| (_ bv5 32)))) (or (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|) .cse1 .cse2 .cse3 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv2 32))) (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv4 32)) .cse3 (= |ULTIMATE.start_main_~b~0#1| (_ bv8 32))))) [2023-12-25 01:19:08,330 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-12-25 01:19:08,330 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 46) no Hoare annotation was computed. [2023-12-25 01:19:08,332 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 38 47) the Hoare annotation is: (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_main_~r~0#1|)) (.cse8 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv2 32)))) (let ((.cse1 (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse9 (not .cse8)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse5 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv4 32))) (.cse2 (bvule |ULTIMATE.start_main_~r~0#1| (_ bv5 32))) (.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse4 (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|)) (.cse10 (= |ULTIMATE.start_main_~A~0#1| .cse11)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)))) (or (and .cse0 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv2 32))) .cse1 (not (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv4 32))) .cse2 .cse3) (and .cse0 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|))) (and .cse0 .cse4 (not .cse5) .cse6 .cse7 .cse8) (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) .cse1 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse10 .cse9 (= |ULTIMATE.start_main_~q~0#1| (_ bv2 32))) (and .cse0 .cse6 .cse7 .cse5 .cse2 (= |ULTIMATE.start_main_~b~0#1| (_ bv8 32))) (and .cse0 .cse4 .cse10 (bvule .cse11 (_ bv5 32)) (bvuge .cse11 (_ bv4 32)) .cse3)))) [2023-12-25 01:19:08,332 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse11 (bvadd (_ bv4 32) |ULTIMATE.start_main_~r~0#1|)) (.cse8 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv2 32)))) (let ((.cse1 (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse9 (not .cse8)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse7 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse5 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv4 32))) (.cse2 (bvule |ULTIMATE.start_main_~r~0#1| (_ bv5 32))) (.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse4 (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|)) (.cse10 (= |ULTIMATE.start_main_~A~0#1| .cse11)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)))) (or (and .cse0 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv2 32))) .cse1 (not (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv4 32))) .cse2 .cse3) (and .cse0 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|))) (and .cse0 .cse4 (not .cse5) .cse6 .cse7 .cse8) (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) .cse1 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse10 .cse9 (= |ULTIMATE.start_main_~q~0#1| (_ bv2 32))) (and .cse0 .cse6 .cse7 .cse5 .cse2 (= |ULTIMATE.start_main_~b~0#1| (_ bv8 32))) (and .cse0 .cse4 .cse10 (bvule .cse11 (_ bv5 32)) (bvuge .cse11 (_ bv4 32)) .cse3)))) [2023-12-25 01:19:08,332 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 38 47) no Hoare annotation was computed. [2023-12-25 01:19:08,332 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-12-25 01:19:08,332 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2023-12-25 01:19:08,332 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2023-12-25 01:19:08,332 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 18 24) the Hoare annotation is: true [2023-12-25 01:19:08,332 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2023-12-25 01:19:08,332 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2023-12-25 01:19:08,333 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-12-25 01:19:08,336 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1] [2023-12-25 01:19:08,337 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:19:08,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:19:08 BoogieIcfgContainer [2023-12-25 01:19:08,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:19:08,377 INFO L158 Benchmark]: Toolchain (without parser) took 199601.46ms. Allocated memory is still 226.5MB. Free memory was 184.0MB in the beginning and 175.4MB in the end (delta: 8.6MB). Peak memory consumption was 121.1MB. Max. memory is 8.0GB. [2023-12-25 01:19:08,378 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:19:08,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.04ms. Allocated memory is still 226.5MB. Free memory was 183.8MB in the beginning and 172.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:19:08,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.35ms. Allocated memory is still 226.5MB. Free memory was 172.3MB in the beginning and 170.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:19:08,378 INFO L158 Benchmark]: Boogie Preprocessor took 24.71ms. Allocated memory is still 226.5MB. Free memory was 170.7MB in the beginning and 168.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:19:08,378 INFO L158 Benchmark]: RCFGBuilder took 220.14ms. Allocated memory is still 226.5MB. Free memory was 168.9MB in the beginning and 157.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:19:08,378 INFO L158 Benchmark]: TraceAbstraction took 199146.21ms. Allocated memory is still 226.5MB. Free memory was 156.8MB in the beginning and 175.4MB in the end (delta: -18.6MB). Peak memory consumption was 93.9MB. Max. memory is 8.0GB. [2023-12-25 01:19:08,379 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.04ms. Allocated memory is still 226.5MB. Free memory was 183.8MB in the beginning and 172.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.35ms. Allocated memory is still 226.5MB. Free memory was 172.3MB in the beginning and 170.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.71ms. Allocated memory is still 226.5MB. Free memory was 170.7MB in the beginning and 168.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 220.14ms. Allocated memory is still 226.5MB. Free memory was 168.9MB in the beginning and 157.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 199146.21ms. Allocated memory is still 226.5MB. Free memory was 156.8MB in the beginning and 175.4MB in the end (delta: -18.6MB). Peak memory consumption was 93.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: 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 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 199.1s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 141.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 427 SdHoareTripleChecker+Valid, 89.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 405 mSDsluCounter, 1588 SdHoareTripleChecker+Invalid, 88.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1374 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2002 IncrementalHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 214 mSDtfsCounter, 2002 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 5 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 72.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 95 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 63 PreInvPairs, 108 NumberOfFragments, 368 HoareAnnotationTreeSize, 63 FormulaSimplifications, 23000 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FormulaSimplificationsInter, 1180 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 51.2s InterpolantComputationTime, 337 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 597 ConstructedInterpolants, 20 QuantifiedInterpolants, 5143 SizeOfPredicates, 38 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 352/620 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: 38]: Loop Invariant Derived loop invariant: ((((((((((((B == 1) && (A == ((r + 2) % 4294967296))) && (b == 2)) && !((A >= 4))) && (r <= 5)) && (q == 1)) || ((((B == 1) && (A <= 5)) && (b == 1)) && (A == ((r + q) % 4294967296)))) || ((((((B == 1) && (4 == b)) && !((r >= 4))) && (r == A)) && (q == 0)) && (r >= 2))) || ((((((B == 1) && (r >= 1)) && (b == 2)) && (r == A)) && (q == 0)) && !((r >= 2)))) || (((((B == 1) && (b == 2)) && (A == ((4 + r) % 4294967296))) && !((r >= 2))) && (q == 2))) || ((((((B == 1) && (r == A)) && (q == 0)) && (r >= 4)) && (r <= 5)) && (b == 8))) || ((((((B == 1) && (4 == b)) && (A == ((4 + r) % 4294967296))) && (((4 + r) % 4294967296) <= 5)) && (((4 + r) % 4294967296) >= 4)) && (q == 1))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((B == 1) && (4 == b)) && (r == A)) && (q == 0)) && (r <= 5)) && (r >= 2)) || ((((((B == 1) && (r >= 1)) && (b == 2)) && (r == A)) && (q == 0)) && (r <= 5))) || (((((B == 1) && (b == 1)) && (r == A)) && (q == 0)) && (r <= 5))) || ((((((B == 1) && (r == A)) && (q == 0)) && (r >= 4)) && (r <= 5)) && (b == 8))) RESULT: Ultimate proved your program to be correct! [2023-12-25 01:19:08,440 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...