/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/cohendiv-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:58:43,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:58:43,889 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 00:58:43,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:58:43,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:58:43,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:58:43,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:58:43,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:58:43,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:58:43,919 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:58:43,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:58:43,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:58:43,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:58:43,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:58:43,921 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:58:43,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:58:43,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:58:43,922 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:58:43,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:58:43,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:58:43,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:58:43,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:58:43,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:58:43,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:58:43,923 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:58:43,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:58:43,923 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:58:43,923 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:58:43,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:58:43,924 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:58:43,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:58:43,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:58:43,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:58:43,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:58:43,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:58:43,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:58:43,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:58:43,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:58:43,926 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:58:43,926 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:58:43,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:58:43,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:58:43,926 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:58:43,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:58:43,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:58:43,927 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:58:43,927 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 00:58:44,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:58:44,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:58:44,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:58:44,132 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:58:44,133 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:58:44,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound5.c [2023-12-25 00:58:45,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:58:45,243 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:58:45,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound5.c [2023-12-25 00:58:45,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ecb0d26d/d611b4747a4e4a798ee26ee7fd55eb27/FLAG6bd03af47 [2023-12-25 00:58:45,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ecb0d26d/d611b4747a4e4a798ee26ee7fd55eb27 [2023-12-25 00:58:45,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:58:45,263 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:58:45,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:58:45,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:58:45,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:58:45,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3e2820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45, skipping insertion in model container [2023-12-25 00:58:45,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,285 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:58:45,397 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/cohendiv-ll_valuebound5.c[576,589] [2023-12-25 00:58:45,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:58:45,423 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:58:45,431 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/cohendiv-ll_valuebound5.c[576,589] [2023-12-25 00:58:45,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:58:45,446 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:58:45,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45 WrapperNode [2023-12-25 00:58:45,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:58:45,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:58:45,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:58:45,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:58:45,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,473 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-25 00:58:45,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:58:45,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:58:45,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:58:45,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:58:45,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,497 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 00:58:45,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:58:45,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:58:45,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:58:45,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:58:45,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (1/1) ... [2023-12-25 00:58:45,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:58:45,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:58:45,539 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 00:58:45,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:58:45,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:58:45,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 00:58:45,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 00:58:45,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:58:45,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:58:45,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:58:45,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:58:45,556 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 00:58:45,620 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:58:45,621 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:58:45,780 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:58:45,812 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:58:45,812 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 00:58:45,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:58:45 BoogieIcfgContainer [2023-12-25 00:58:45,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:58:45,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:58:45,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:58:45,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:58:45,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:58:45" (1/3) ... [2023-12-25 00:58:45,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3ae542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:58:45, skipping insertion in model container [2023-12-25 00:58:45,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:58:45" (2/3) ... [2023-12-25 00:58:45,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3ae542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:58:45, skipping insertion in model container [2023-12-25 00:58:45,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:58:45" (3/3) ... [2023-12-25 00:58:45,824 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound5.c [2023-12-25 00:58:45,835 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:58:45,835 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:58:45,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:58:45,879 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;@491cfae5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:58:45,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:58:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 00:58:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 00:58:45,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:45,886 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:45,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:58:45,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:58:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1096708698, now seen corresponding path program 1 times [2023-12-25 00:58:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:58:45,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305705934] [2023-12-25 00:58:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:58:45,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 00:58:45,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:58:45,901 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 00:58:45,902 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 00:58:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:58:45,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:58:45,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:58:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 00:58:46,016 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:58:46,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:58:46,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305705934] [2023-12-25 00:58:46,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305705934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:58:46,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:58:46,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:58:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141352980] [2023-12-25 00:58:46,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:58:46,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:58:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:58:46,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:58:46,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:58:46,041 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 00:58:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:58:46,065 INFO L93 Difference]: Finished difference Result 60 states and 99 transitions. [2023-12-25 00:58:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:58:46,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 00:58:46,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:58:46,072 INFO L225 Difference]: With dead ends: 60 [2023-12-25 00:58:46,072 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 00:58:46,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:58:46,077 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:58:46,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:58:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 00:58:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 00:58:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 00:58:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-12-25 00:58:46,114 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 23 [2023-12-25 00:58:46,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:58:46,115 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-12-25 00:58:46,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 00:58:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-12-25 00:58:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 00:58:46,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:46,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:46,119 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 00:58:46,319 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 00:58:46,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:58:46,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:58:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2049551268, now seen corresponding path program 1 times [2023-12-25 00:58:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:58:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124337360] [2023-12-25 00:58:46,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:58:46,321 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 00:58:46,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:58:46,322 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 00:58:46,324 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 00:58:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:58:46,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:58:46,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:58:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:58:46,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:58:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 00:58:47,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:58:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124337360] [2023-12-25 00:58:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124337360] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:58:47,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:58:47,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-25 00:58:47,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920168468] [2023-12-25 00:58:47,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:58:47,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:58:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:58:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:58:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-25 00:58:47,587 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 00:58:53,054 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 00:58:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:58:53,575 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-12-25 00:58:53,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:58:53,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-25 00:58:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:58:53,576 INFO L225 Difference]: With dead ends: 48 [2023-12-25 00:58:53,576 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 00:58:53,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:58:53,578 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-25 00:58:53,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2023-12-25 00:58:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 00:58:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2023-12-25 00:58:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-25 00:58:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-12-25 00:58:53,597 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 23 [2023-12-25 00:58:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:58:53,599 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-12-25 00:58:53,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 00:58:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-12-25 00:58:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 00:58:53,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:53,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:53,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 00:58:53,803 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 00:58:53,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:58:53,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:58:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1906772284, now seen corresponding path program 1 times [2023-12-25 00:58:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:58:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472973003] [2023-12-25 00:58:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:58:53,805 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 00:58:53,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:58:53,806 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 00:58:53,809 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 00:58:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:58:53,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 00:58:53,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:58:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:58:54,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:58:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 00:58:55,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:58:55,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472973003] [2023-12-25 00:58:55,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472973003] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:58:55,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:58:55,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 00:58:55,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339994993] [2023-12-25 00:58:55,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:58:55,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:58:55,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:58:55,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:58:55,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:58:55,703 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:58:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:58:58,088 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2023-12-25 00:58:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:58:58,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-25 00:58:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:58:58,098 INFO L225 Difference]: With dead ends: 66 [2023-12-25 00:58:58,098 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 00:58:58,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:58:58,099 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:58:58,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 00:58:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 00:58:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-12-25 00:58:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 00:58:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2023-12-25 00:58:58,113 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 28 [2023-12-25 00:58:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:58:58,113 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2023-12-25 00:58:58,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:58:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2023-12-25 00:58:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 00:58:58,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:58,114 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:58,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 00:58:58,319 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 00:58:58,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:58:58,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:58:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash -170967411, now seen corresponding path program 1 times [2023-12-25 00:58:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:58:58,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675933320] [2023-12-25 00:58:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:58:58,321 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 00:58:58,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:58:58,322 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 00:58:58,323 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 00:58:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:58:58,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 00:58:58,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:58:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 00:58:58,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:58:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 00:58:58,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:58:58,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675933320] [2023-12-25 00:58:58,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675933320] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:58:58,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:58:58,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-25 00:58:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233321935] [2023-12-25 00:58:58,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:58:58,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 00:58:58,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:58:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 00:58:58,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:58:58,869 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 00:58:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:58:59,851 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2023-12-25 00:58:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 00:58:59,855 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 45 [2023-12-25 00:58:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:58:59,858 INFO L225 Difference]: With dead ends: 69 [2023-12-25 00:58:59,858 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 00:58:59,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:58:59,859 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 00:58:59,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 182 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 00:58:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 00:58:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-12-25 00:58:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 00:58:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2023-12-25 00:58:59,870 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 45 [2023-12-25 00:58:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:58:59,871 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2023-12-25 00:58:59,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 00:58:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2023-12-25 00:58:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 00:58:59,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:58:59,872 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:58:59,877 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 00:59:00,079 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 00:59:00,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:59:00,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:59:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1378270461, now seen corresponding path program 1 times [2023-12-25 00:59:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:59:00,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367086751] [2023-12-25 00:59:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:59:00,081 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 00:59:00,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:59:00,084 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 00:59:00,085 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 00:59:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:59:00,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 00:59:00,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:59:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 00:59:00,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:59:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-25 00:59:26,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:59:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367086751] [2023-12-25 00:59:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367086751] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:59:26,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:59:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2023-12-25 00:59:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748768849] [2023-12-25 00:59:26,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:59:26,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 00:59:26,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:59:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 00:59:26,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=388, Unknown=2, NotChecked=0, Total=462 [2023-12-25 00:59:26,116 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 10 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-25 00:59:43,929 WARN L293 SmtUtils]: Spent 12.62s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:59:54,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:59:58,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:06,819 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:00:10,949 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:00:14,974 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:00:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:00:16,093 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2023-12-25 01:00:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 01:00:16,103 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 10 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) Word has length 51 [2023-12-25 01:00:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:00:16,104 INFO L225 Difference]: With dead ends: 83 [2023-12-25 01:00:16,104 INFO L226 Difference]: Without dead ends: 81 [2023-12-25 01:00:16,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=211, Invalid=909, Unknown=2, NotChecked=0, Total=1122 [2023-12-25 01:00:16,105 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 96 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 90 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:00:16,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 165 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 202 Invalid, 5 Unknown, 0 Unchecked, 27.9s Time] [2023-12-25 01:00:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-25 01:00:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2023-12-25 01:00:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 44 states have internal predecessors, (48), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 01:00:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2023-12-25 01:00:16,124 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 51 [2023-12-25 01:00:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:00:16,124 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2023-12-25 01:00:16,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 10 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-25 01:00:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2023-12-25 01:00:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 01:00:16,126 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:00:16,126 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:00:16,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 01:00:16,328 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:00:16,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:00:16,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:00:16,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1550111725, now seen corresponding path program 1 times [2023-12-25 01:00:16,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:00:16,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578093288] [2023-12-25 01:00:16,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:00:16,331 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:00:16,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:00:16,333 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:00:16,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 01:00:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:00:16,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:00:16,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:00:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:00:17,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:00:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:00:37,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:00:37,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578093288] [2023-12-25 01:00:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578093288] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:00:37,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:00:37,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2023-12-25 01:00:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80365685] [2023-12-25 01:00:37,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:00:37,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:00:37,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:00:37,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:00:37,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:00:37,028 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 01:00:42,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:47,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:53,547 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:00:57,558 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:01:02,610 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:01:06,620 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:01:15,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:17,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:17,408 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2023-12-25 01:01:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:01:17,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2023-12-25 01:01:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:17,431 INFO L225 Difference]: With dead ends: 106 [2023-12-25 01:01:17,431 INFO L226 Difference]: Without dead ends: 103 [2023-12-25 01:01:17,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:01:17,432 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 38 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:17,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 114 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 72 Invalid, 4 Unknown, 0 Unchecked, 32.5s Time] [2023-12-25 01:01:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-25 01:01:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2023-12-25 01:01:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-25 01:01:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2023-12-25 01:01:17,447 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 58 [2023-12-25 01:01:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:17,447 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2023-12-25 01:01:17,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 01:01:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2023-12-25 01:01:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 01:01:17,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:17,448 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:17,455 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:01:17,655 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:01:17,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:17,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash -426664645, now seen corresponding path program 1 times [2023-12-25 01:01:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724955468] [2023-12-25 01:01:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:01:17,656 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:01:17,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:17,657 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:01:17,658 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:01:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:17,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 01:01:17,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 01:01:18,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:01:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 01:01:34,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:01:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724955468] [2023-12-25 01:01:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724955468] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:01:34,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:01:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 22 [2023-12-25 01:01:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424097400] [2023-12-25 01:01:34,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:01:34,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 01:01:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:01:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 01:01:34,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:01:34,559 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 22 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 10 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 9 states have call predecessors, (18), 8 states have call successors, (18) [2023-12-25 01:01:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:47,845 INFO L93 Difference]: Finished difference Result 146 states and 195 transitions. [2023-12-25 01:01:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 01:01:47,846 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 10 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 9 states have call predecessors, (18), 8 states have call successors, (18) Word has length 58 [2023-12-25 01:01:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:47,849 INFO L225 Difference]: With dead ends: 146 [2023-12-25 01:01:47,849 INFO L226 Difference]: Without dead ends: 144 [2023-12-25 01:01:47,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2023-12-25 01:01:47,850 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 102 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:47,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 393 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-12-25 01:01:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-25 01:01:47,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 107. [2023-12-25 01:01:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 65 states have internal predecessors, (70), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-25 01:01:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 135 transitions. [2023-12-25 01:01:47,895 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 135 transitions. Word has length 58 [2023-12-25 01:01:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:47,896 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 135 transitions. [2023-12-25 01:01:47,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 10 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 9 states have call predecessors, (18), 8 states have call successors, (18) [2023-12-25 01:01:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 135 transitions. [2023-12-25 01:01:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 01:01:47,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:47,901 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:47,913 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:01:48,110 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:01:48,111 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:48,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash -521649002, now seen corresponding path program 2 times [2023-12-25 01:01:48,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:48,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567543206] [2023-12-25 01:01:48,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:01:48,113 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:01:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:48,114 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:01:48,115 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:01:48,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:01:48,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:01:48,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:01:48,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-12-25 01:01:48,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:01:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-12-25 01:01:49,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:01:49,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567543206] [2023-12-25 01:01:49,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567543206] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:01:49,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:01:49,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-25 01:01:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896228859] [2023-12-25 01:01:49,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:01:49,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 01:01:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:01:49,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 01:01:49,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:01:49,017 INFO L87 Difference]: Start difference. First operand 107 states and 135 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 5 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2023-12-25 01:01:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:49,730 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2023-12-25 01:01:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:01:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 5 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 75 [2023-12-25 01:01:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:49,760 INFO L225 Difference]: With dead ends: 113 [2023-12-25 01:01:49,760 INFO L226 Difference]: Without dead ends: 111 [2023-12-25 01:01:49,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-12-25 01:01:49,761 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:49,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 180 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 01:01:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-25 01:01:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-25 01:01:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 65 states have (on average 1.123076923076923) internal successors, (73), 68 states have internal predecessors, (73), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-25 01:01:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2023-12-25 01:01:49,780 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 75 [2023-12-25 01:01:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:49,781 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2023-12-25 01:01:49,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 5 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2023-12-25 01:01:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2023-12-25 01:01:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 01:01:49,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:49,782 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:49,804 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:01:49,989 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:01:49,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:49,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash 673882661, now seen corresponding path program 1 times [2023-12-25 01:01:49,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:49,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089608250] [2023-12-25 01:01:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:01:49,993 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:01:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:49,994 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:01:49,995 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:01:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:01:50,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 01:01:50,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 40 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-25 01:01:53,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:03:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 39 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-25 01:03:15,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:03:15,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089608250] [2023-12-25 01:03:15,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089608250] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:03:15,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:03:15,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2023-12-25 01:03:15,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534959065] [2023-12-25 01:03:15,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:03:15,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 01:03:15,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:03:15,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 01:03:15,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:03:15,442 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 27 states, 25 states have (on average 1.68) internal successors, (42), 22 states have internal predecessors, (42), 14 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 14 states have call predecessors, (26), 14 states have call successors, (26) [2023-12-25 01:03:47,733 WARN L293 SmtUtils]: Spent 13.57s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:03:49,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:50,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:58,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:59,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:19,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:23,528 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:04:27,546 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:04:31,561 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:04:35,575 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:04:45,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:49,365 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:04:53,384 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:04:57,583 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:05:06,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:10,980 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:05:15,002 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:05:19,016 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:05:23,028 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:05:28,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:32,680 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:05:36,882 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:05:41,011 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:05:45,133 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:05:49,772 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:05:53,834 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:05:57,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:01,865 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:06:09,866 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:06:13,884 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:06:17,899 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:06:21,909 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:06:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:06:23,781 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2023-12-25 01:06:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 01:06:23,798 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 22 states have internal predecessors, (42), 14 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 14 states have call predecessors, (26), 14 states have call successors, (26) Word has length 81 [2023-12-25 01:06:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:06:23,798 INFO L225 Difference]: With dead ends: 157 [2023-12-25 01:06:23,798 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 01:06:23,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 101.5s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 01:06:23,800 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 115 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 143.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 145.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:06:23,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 327 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 474 Invalid, 26 Unknown, 0 Unchecked, 145.8s Time] [2023-12-25 01:06:23,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 01:06:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 01:06:23,801 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:06:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 01:06:23,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2023-12-25 01:06:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:06:23,801 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 01:06:23,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 22 states have internal predecessors, (42), 14 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (26), 14 states have call predecessors, (26), 14 states have call successors, (26) [2023-12-25 01:06:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 01:06:23,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 01:06:23,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:06:23,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:06:24,007 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:06:24,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 01:07:15,016 WARN L293 SmtUtils]: Spent 49.08s on a formula simplification. DAG size of input: 117 DAG size of output: 33 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:07:26,705 WARN L293 SmtUtils]: Spent 7.46s on a formula simplification. DAG size of input: 188 DAG size of output: 33 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:08:10,989 WARN L293 SmtUtils]: Spent 44.28s on a formula simplification. DAG size of input: 167 DAG size of output: 38 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:08:56,590 WARN L293 SmtUtils]: Spent 45.60s on a formula simplification. DAG size of input: 167 DAG size of output: 38 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:09:07,822 WARN L293 SmtUtils]: Spent 11.23s on a formula simplification. DAG size of input: 184 DAG size of output: 28 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:09:20,817 WARN L293 SmtUtils]: Spent 12.99s on a formula simplification. DAG size of input: 184 DAG size of output: 28 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:09:25,282 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-25 01:09:25,282 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2023-12-25 01:09:25,282 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2023-12-25 01:09:25,282 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-12-25 01:09:25,282 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv5 32)) (exists ((v_subst_15 (_ BitVec 32))) (and (bvsge v_subst_15 (_ bv0 32)) (bvsle v_subst_15 (_ bv5 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_15)))) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))))) [2023-12-25 01:09:25,283 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (or (bvsge |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 32))))) (not (bvsge |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~b~0#1| (_ bv2 64))))) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv5 32)) (exists ((v_subst_15 (_ BitVec 32))) (and (bvsge v_subst_15 (_ bv0 32)) (bvsle v_subst_15 (_ bv5 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_15)))) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))))) [2023-12-25 01:09:25,283 INFO L899 garLoopResultBuilder]: For program point L40(lines 38 62) no Hoare annotation was computed. [2023-12-25 01:09:25,283 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (or (bvsge |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 32))))) (not (bvsge |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~b~0#1| (_ bv2 64))))) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv5 32)) (exists ((v_subst_15 (_ BitVec 32))) (and (bvsge v_subst_15 (_ bv0 32)) (bvsle v_subst_15 (_ bv5 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_15)))) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))))) [2023-12-25 01:09:25,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 01:09:25,283 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32))) [2023-12-25 01:09:25,283 INFO L895 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32))) [2023-12-25 01:09:25,283 INFO L899 garLoopResultBuilder]: For program point L50(lines 47 59) no Hoare annotation was computed. [2023-12-25 01:09:25,283 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 01:09:25,283 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv5 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))))) [2023-12-25 01:09:25,283 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)))) [2023-12-25 01:09:25,284 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv5 32)) (exists ((v_subst_15 (_ BitVec 32))) (and (bvsge v_subst_15 (_ bv0 32)) (bvsle v_subst_15 (_ bv5 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_15)))) (bvsge |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 32))))) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))))) [2023-12-25 01:09:25,284 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2023-12-25 01:09:25,284 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv5 32)) (exists ((v_subst_15 (_ BitVec 32))) (and (bvsge v_subst_15 (_ bv0 32)) (bvsle v_subst_15 (_ bv5 32)) (bvsge |ULTIMATE.start_main_~r~0#1| ((_ sign_extend 32) v_subst_15)))) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))))) [2023-12-25 01:09:25,284 INFO L899 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2023-12-25 01:09:25,284 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~b~0#1|) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv5 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))))) [2023-12-25 01:09:25,284 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (or (bvsge |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 32))))) (not (bvsge |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~b~0#1| (_ bv2 64))))) (= (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~r~0#1| .cse1 (bvneg |ULTIMATE.start_main_~b~0#1|)) .cse2) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv5 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= .cse2 (bvadd |ULTIMATE.start_main_~r~0#1| .cse1))))) [2023-12-25 01:09:25,284 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-12-25 01:09:25,284 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-12-25 01:09:25,284 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-12-25 01:09:25,284 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-12-25 01:09:25,284 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-12-25 01:09:25,284 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-12-25 01:09:25,284 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-12-25 01:09:25,284 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-12-25 01:09:25,285 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-12-25 01:09:25,285 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-12-25 01:09:25,290 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:09:25,291 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:09:25,306 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_15 : bv32 :: (~bvsge~64(v_subst_15, 0bv32) && ~bvsle~32(v_subst_15, 5bv32)) && ~bvsge~64(~r~0, ~sign_extend~64~32(v_subst_15))) could not be translated [2023-12-25 01:09:25,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:09:25 BoogieIcfgContainer [2023-12-25 01:09:25,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:09:25,309 INFO L158 Benchmark]: Toolchain (without parser) took 640046.65ms. Allocated memory was 179.3MB in the beginning and 255.9MB in the end (delta: 76.5MB). Free memory was 128.8MB in the beginning and 153.0MB in the end (delta: -24.3MB). Peak memory consumption was 135.4MB. Max. memory is 8.0GB. [2023-12-25 01:09:25,309 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:09:25,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.03ms. Allocated memory is still 179.3MB. Free memory was 128.5MB in the beginning and 117.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:09:25,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.67ms. Allocated memory is still 179.3MB. Free memory was 117.0MB in the beginning and 115.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:09:25,310 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 179.3MB. Free memory was 115.2MB in the beginning and 113.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:09:25,310 INFO L158 Benchmark]: RCFGBuilder took 295.06ms. Allocated memory is still 179.3MB. Free memory was 113.4MB in the beginning and 100.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 01:09:25,311 INFO L158 Benchmark]: TraceAbstraction took 639495.17ms. Allocated memory was 179.3MB in the beginning and 255.9MB in the end (delta: 76.5MB). Free memory was 100.2MB in the beginning and 153.0MB in the end (delta: -52.8MB). Peak memory consumption was 107.1MB. Max. memory is 8.0GB. [2023-12-25 01:09:25,312 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 179.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.03ms. Allocated memory is still 179.3MB. Free memory was 128.5MB in the beginning and 117.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.67ms. Allocated memory is still 179.3MB. Free memory was 117.0MB in the beginning and 115.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 179.3MB. Free memory was 115.2MB in the beginning and 113.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 295.06ms. Allocated memory is still 179.3MB. Free memory was 113.4MB in the beginning and 100.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 639495.17ms. Allocated memory was 179.3MB in the beginning and 255.9MB in the end (delta: 76.5MB). Free memory was 100.2MB in the beginning and 153.0MB in the end (delta: -52.8MB). Peak memory consumption was 107.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_15 : bv32 :: (~bvsge~64(v_subst_15, 0bv32) && ~bvsle~32(v_subst_15, 5bv32)) && ~bvsge~64(~r~0, ~sign_extend~64~32(v_subst_15))) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 639.4s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 302.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 181.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 224.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 403 mSDsluCounter, 1609 SdHoareTripleChecker+Invalid, 218.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1351 mSDsCounter, 368 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1604 IncrementalHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 368 mSolverCounterUnsat, 258 mSDtfsCounter, 1604 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 893 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 183.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=8, InterpolantAutomatonStates: 100, 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, 9 MinimizatonAttempts, 59 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 72 PreInvPairs, 136 NumberOfFragments, 378 HoareAnnotationTreeSize, 72 FormulaSimplifications, 3637 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 14 FormulaSimplificationsInter, 7516 FormulaSimplificationTreeSizeReductionInter, 181.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 152.7s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 844 ConstructedInterpolants, 35 QuantifiedInterpolants, 4278 SizeOfPredicates, 43 NumberOfNonLiveVariables, 741 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 1279/1426 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: 47]: Loop Invariant Derived loop invariant: ((((((x >= 0) && ((a * y) == b)) && (y <= 5)) && (x <= 5)) && (y >= 1)) && (x == ((r + (q * y)) % 1))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((x >= 0) && ((a * y) == b)) && (y <= 5)) && (x <= 5)) && (y >= 1)) && (x == ((r + (q * y)) % 1))) RESULT: Ultimate proved your program to be correct! [2023-12-25 01:09:25,380 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...