/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/loops-crafted-1/sumt7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 23:53:30,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 23:53:30,402 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-24 23:53:30,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 23:53:30,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 23:53:30,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 23:53:30,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 23:53:30,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 23:53:30,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 23:53:30,431 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 23:53:30,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 23:53:30,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 23:53:30,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 23:53:30,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 23:53:30,433 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 23:53:30,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 23:53:30,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 23:53:30,434 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 23:53:30,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 23:53:30,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 23:53:30,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 23:53:30,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 23:53:30,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 23:53:30,435 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 23:53:30,435 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 23:53:30,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 23:53:30,435 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 23:53:30,435 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 23:53:30,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 23:53:30,436 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 23:53:30,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 23:53:30,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 23:53:30,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 23:53:30,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 23:53:30,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:53:30,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 23:53:30,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 23:53:30,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 23:53:30,437 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 23:53:30,437 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 23:53:30,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 23:53:30,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 23:53:30,438 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 23:53:30,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 23:53:30,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 23:53:30,438 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 23:53:30,438 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-24 23:53:30,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 23:53:30,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 23:53:30,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 23:53:30,644 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 23:53:30,644 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 23:53:30,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt7.c [2023-12-24 23:53:31,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 23:53:31,885 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 23:53:31,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c [2023-12-24 23:53:31,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc801538c/463770a30ef8482583274adce7ddcd0e/FLAG6436a8631 [2023-12-24 23:53:31,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc801538c/463770a30ef8482583274adce7ddcd0e [2023-12-24 23:53:31,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 23:53:31,907 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 23:53:31,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 23:53:31,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 23:53:31,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 23:53:31,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:53:31" (1/1) ... [2023-12-24 23:53:31,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43252cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:31, skipping insertion in model container [2023-12-24 23:53:31,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:53:31" (1/1) ... [2023-12-24 23:53:31,930 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 23:53:32,028 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c[403,416] [2023-12-24 23:53:32,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:53:32,052 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 23:53:32,062 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt7.c[403,416] [2023-12-24 23:53:32,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:53:32,076 INFO L206 MainTranslator]: Completed translation [2023-12-24 23:53:32,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32 WrapperNode [2023-12-24 23:53:32,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 23:53:32,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 23:53:32,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 23:53:32,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 23:53:32,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,110 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2023-12-24 23:53:32,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 23:53:32,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 23:53:32,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 23:53:32,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 23:53:32,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,138 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-24 23:53:32,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 23:53:32,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 23:53:32,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 23:53:32,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 23:53:32,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (1/1) ... [2023-12-24 23:53:32,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:53:32,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 23:53:32,187 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-24 23:53:32,228 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-24 23:53:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 23:53:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 23:53:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 23:53:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 23:53:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 23:53:32,287 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 23:53:32,290 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 23:53:32,625 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 23:53:32,642 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 23:53:32,642 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 23:53:32,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:53:32 BoogieIcfgContainer [2023-12-24 23:53:32,642 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 23:53:32,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 23:53:32,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 23:53:32,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 23:53:32,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 11:53:31" (1/3) ... [2023-12-24 23:53:32,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680912d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:53:32, skipping insertion in model container [2023-12-24 23:53:32,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:32" (2/3) ... [2023-12-24 23:53:32,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680912d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:53:32, skipping insertion in model container [2023-12-24 23:53:32,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:53:32" (3/3) ... [2023-12-24 23:53:32,648 INFO L112 eAbstractionObserver]: Analyzing ICFG sumt7.c [2023-12-24 23:53:32,659 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 23:53:32,659 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 23:53:32,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 23:53:32,696 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;@50a331e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 23:53:32,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 23:53:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 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-24 23:53:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 23:53:32,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:53:32,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:53:32,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:53:32,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:53:32,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1291809002, now seen corresponding path program 1 times [2023-12-24 23:53:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:53:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410470172] [2023-12-24 23:53:32,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:53:32,726 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-24 23:53:32,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:53:32,727 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-24 23:53:32,729 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-24 23:53:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:53:32,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 23:53:32,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:53:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:53:33,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 23:53:33,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:53:33,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410470172] [2023-12-24 23:53:33,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410470172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 23:53:33,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 23:53:33,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 23:53:33,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838559316] [2023-12-24 23:53:33,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 23:53:33,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 23:53:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:53:33,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 23:53:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 23:53:33,199 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 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) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-24 23:53:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:53:33,428 INFO L93 Difference]: Finished difference Result 39 states and 60 transitions. [2023-12-24 23:53:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 23:53:33,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2023-12-24 23:53:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:53:33,435 INFO L225 Difference]: With dead ends: 39 [2023-12-24 23:53:33,435 INFO L226 Difference]: Without dead ends: 19 [2023-12-24 23:53:33,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 23:53:33,442 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 23:53:33,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 23:53:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-24 23:53:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2023-12-24 23:53:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-24 23:53:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-12-24 23:53:33,466 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 7 [2023-12-24 23:53:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:53:33,467 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-12-24 23:53:33,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-24 23:53:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-12-24 23:53:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 23:53:33,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:53:33,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:53:33,472 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-24 23:53:33,672 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-24 23:53:33,673 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:53:33,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:53:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1139039484, now seen corresponding path program 1 times [2023-12-24 23:53:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:53:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699600934] [2023-12-24 23:53:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:53:33,674 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-24 23:53:33,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:53:33,675 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-24 23:53:33,702 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-24 23:53:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:53:33,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 23:53:33,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:53:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:53:33,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:53:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:53:34,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:53:34,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699600934] [2023-12-24 23:53:34,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699600934] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:53:34,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:53:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 23:53:34,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463784306] [2023-12-24 23:53:34,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:53:34,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 23:53:34,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:53:34,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 23:53:34,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 23:53:34,237 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-24 23:53:37,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:53:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:53:37,912 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2023-12-24 23:53:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 23:53:37,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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) Word has length 12 [2023-12-24 23:53:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:53:37,917 INFO L225 Difference]: With dead ends: 58 [2023-12-24 23:53:37,917 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 23:53:37,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 23:53:37,918 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-24 23:53:37,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 22 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-24 23:53:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 23:53:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2023-12-24 23:53:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 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-24 23:53:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-12-24 23:53:37,923 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 12 [2023-12-24 23:53:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:53:37,924 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-12-24 23:53:37,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-24 23:53:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-12-24 23:53:37,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 23:53:37,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:53:37,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:53:37,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 23:53:38,127 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-24 23:53:38,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:53:38,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:53:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash -938670594, now seen corresponding path program 1 times [2023-12-24 23:53:38,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:53:38,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512399411] [2023-12-24 23:53:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:53:38,129 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-24 23:53:38,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:53:38,130 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-24 23:53:38,132 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-24 23:53:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:53:38,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 23:53:38,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:53:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:53:38,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:53:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 23:53:39,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:53:39,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512399411] [2023-12-24 23:53:39,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512399411] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:53:39,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:53:39,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2023-12-24 23:53:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640285455] [2023-12-24 23:53:39,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:53:39,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 23:53:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:53:39,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 23:53:39,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-24 23:53:39,058 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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-24 23:53:43,349 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-24 23:53:47,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:53:51,482 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-24 23:53:55,531 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-24 23:53:59,575 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-24 23:53:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:53:59,896 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2023-12-24 23:53:59,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 23:53:59,900 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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) Word has length 17 [2023-12-24 23:53:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:53:59,901 INFO L225 Difference]: With dead ends: 58 [2023-12-24 23:53:59,901 INFO L226 Difference]: Without dead ends: 56 [2023-12-24 23:53:59,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:53:59,902 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2023-12-24 23:53:59,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 29 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 5 Unknown, 0 Unchecked, 20.7s Time] [2023-12-24 23:53:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-24 23:53:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-24 23:53:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 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-24 23:53:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2023-12-24 23:53:59,908 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 17 [2023-12-24 23:53:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:53:59,919 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2023-12-24 23:53:59,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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-24 23:53:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2023-12-24 23:53:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 23:53:59,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:53:59,925 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:53:59,931 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-24 23:54:00,131 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-24 23:54:00,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:00,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash 657485406, now seen corresponding path program 1 times [2023-12-24 23:54:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137569398] [2023-12-24 23:54:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:00,132 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-24 23:54:00,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:00,138 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-24 23:54:00,139 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-24 23:54:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:00,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 23:54:00,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:00,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:01,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:01,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137569398] [2023-12-24 23:54:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137569398] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:01,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 23:54:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234867355] [2023-12-24 23:54:01,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:01,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 23:54:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 23:54:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-24 23:54:01,492 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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-24 23:54:06,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:54:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:54:08,972 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2023-12-24 23:54:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 23:54:08,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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) Word has length 23 [2023-12-24 23:54:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:54:08,980 INFO L225 Difference]: With dead ends: 121 [2023-12-24 23:54:08,980 INFO L226 Difference]: Without dead ends: 89 [2023-12-24 23:54:08,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:54:08,981 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 81 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:08,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 39 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-24 23:54:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-24 23:54:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2023-12-24 23:54:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 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-24 23:54:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2023-12-24 23:54:08,989 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 23 [2023-12-24 23:54:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:54:08,989 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2023-12-24 23:54:08,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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-24 23:54:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2023-12-24 23:54:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-24 23:54:08,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:08,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:09,003 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-24 23:54:09,195 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-24 23:54:09,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:09,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:09,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1421961556, now seen corresponding path program 1 times [2023-12-24 23:54:09,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:09,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424333217] [2023-12-24 23:54:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:09,197 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-24 23:54:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:09,198 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-24 23:54:09,202 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-24 23:54:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:09,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 23:54:09,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:10,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-24 23:54:10,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:10,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424333217] [2023-12-24 23:54:10,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424333217] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:10,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:10,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2023-12-24 23:54:10,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164991997] [2023-12-24 23:54:10,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:10,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 23:54:10,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:10,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 23:54:10,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:54:10,464 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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-24 23:54:14,844 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-24 23:54:18,887 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-24 23:54:22,951 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-24 23:54:27,229 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-24 23:54:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:54:27,237 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2023-12-24 23:54:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 23:54:27,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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) Word has length 27 [2023-12-24 23:54:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:54:27,242 INFO L225 Difference]: With dead ends: 117 [2023-12-24 23:54:27,242 INFO L226 Difference]: Without dead ends: 115 [2023-12-24 23:54:27,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-24 23:54:27,243 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:27,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 44 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 247 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2023-12-24 23:54:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-24 23:54:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-24 23:54:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 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-24 23:54:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2023-12-24 23:54:27,252 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 27 [2023-12-24 23:54:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:54:27,252 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2023-12-24 23:54:27,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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-24 23:54:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2023-12-24 23:54:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 23:54:27,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:27,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:27,264 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-24 23:54:27,462 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-24 23:54:27,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:27,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash 968633845, now seen corresponding path program 1 times [2023-12-24 23:54:27,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:27,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36082502] [2023-12-24 23:54:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:27,463 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-24 23:54:27,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:27,466 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-24 23:54:27,466 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-24 23:54:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:27,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 23:54:27,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:27,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:29,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:29,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36082502] [2023-12-24 23:54:29,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36082502] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:29,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:29,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-24 23:54:29,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587964714] [2023-12-24 23:54:29,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:29,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 23:54:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:29,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 23:54:29,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-24 23:54:29,376 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 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-24 23:54:38,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:54:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:54:40,600 INFO L93 Difference]: Finished difference Result 292 states and 398 transitions. [2023-12-24 23:54:40,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 23:54:40,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 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) Word has length 34 [2023-12-24 23:54:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:54:40,616 INFO L225 Difference]: With dead ends: 292 [2023-12-24 23:54:40,616 INFO L226 Difference]: Without dead ends: 210 [2023-12-24 23:54:40,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2023-12-24 23:54:40,617 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 89 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:40,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 65 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-24 23:54:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-24 23:54:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2023-12-24 23:54:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.3626943005181347) internal successors, (263), 193 states have internal predecessors, (263), 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-24 23:54:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2023-12-24 23:54:40,630 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 34 [2023-12-24 23:54:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:54:40,630 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2023-12-24 23:54:40,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 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-24 23:54:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2023-12-24 23:54:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 23:54:40,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:40,631 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:40,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 23:54:40,842 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-24 23:54:40,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:40,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1104962800, now seen corresponding path program 1 times [2023-12-24 23:54:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740801753] [2023-12-24 23:54:40,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:40,843 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-24 23:54:40,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:40,844 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-24 23:54:40,846 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-24 23:54:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:41,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 23:54:41,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:41,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-24 23:54:42,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:42,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740801753] [2023-12-24 23:54:42,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740801753] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:42,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:42,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2023-12-24 23:54:42,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219842610] [2023-12-24 23:54:42,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:42,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 23:54:42,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 23:54:42,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-24 23:54:42,503 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 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-24 23:54:47,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-24 23:54:51,153 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-24 23:54:55,486 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-24 23:54:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:54:55,530 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2023-12-24 23:54:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 23:54:55,536 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 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) Word has length 36 [2023-12-24 23:54:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:54:55,537 INFO L225 Difference]: With dead ends: 306 [2023-12-24 23:54:55,537 INFO L226 Difference]: Without dead ends: 304 [2023-12-24 23:54:55,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-12-24 23:54:55,538 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:55,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 47 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 302 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2023-12-24 23:54:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-12-24 23:54:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2023-12-24 23:54:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.33003300330033) internal successors, (403), 303 states have internal predecessors, (403), 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-24 23:54:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 403 transitions. [2023-12-24 23:54:55,557 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 403 transitions. Word has length 36 [2023-12-24 23:54:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:54:55,557 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 403 transitions. [2023-12-24 23:54:55,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 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-24 23:54:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 403 transitions. [2023-12-24 23:54:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-24 23:54:55,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:55,558 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:55,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 23:54:55,779 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-24 23:54:55,779 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:55,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash -524153621, now seen corresponding path program 1 times [2023-12-24 23:54:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:55,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883322360] [2023-12-24 23:54:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:55,780 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-24 23:54:55,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:55,784 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-24 23:54:55,785 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-24 23:54:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:55,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 23:54:55,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:57,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 23:54:57,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:57,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883322360] [2023-12-24 23:54:57,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883322360] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:57,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:57,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 15 [2023-12-24 23:54:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033916414] [2023-12-24 23:54:57,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:57,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 23:54:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 23:54:57,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-24 23:54:57,768 INFO L87 Difference]: Start difference. First operand 304 states and 403 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 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-24 23:55:02,519 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-24 23:55:06,629 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-24 23:55:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:55:06,842 INFO L93 Difference]: Finished difference Result 533 states and 733 transitions. [2023-12-24 23:55:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 23:55:06,847 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 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) Word has length 44 [2023-12-24 23:55:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:55:06,848 INFO L225 Difference]: With dead ends: 533 [2023-12-24 23:55:06,848 INFO L226 Difference]: Without dead ends: 270 [2023-12-24 23:55:06,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-12-24 23:55:06,849 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-24 23:55:06,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 488 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2023-12-24 23:55:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-24 23:55:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2023-12-24 23:55:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 269 states have internal predecessors, (357), 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-24 23:55:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2023-12-24 23:55:06,859 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 44 [2023-12-24 23:55:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:55:06,860 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2023-12-24 23:55:06,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 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-24 23:55:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2023-12-24 23:55:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-24 23:55:06,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:55:06,861 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:55:06,871 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-24 23:55:07,066 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-24 23:55:07,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:55:07,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:55:07,067 INFO L85 PathProgramCache]: Analyzing trace with hash -752901506, now seen corresponding path program 1 times [2023-12-24 23:55:07,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:55:07,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141346117] [2023-12-24 23:55:07,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:55:07,068 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-24 23:55:07,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:55:07,070 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-24 23:55:07,128 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-24 23:55:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:55:07,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 23:55:07,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:55:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:08,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:55:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-12-24 23:55:09,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:55:09,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141346117] [2023-12-24 23:55:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141346117] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:55:09,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:55:09,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 4] total 17 [2023-12-24 23:55:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21792487] [2023-12-24 23:55:09,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:55:09,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 23:55:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:55:09,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 23:55:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-24 23:55:09,443 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 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-24 23:55:14,215 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-24 23:55:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:55:14,502 INFO L93 Difference]: Finished difference Result 513 states and 707 transitions. [2023-12-24 23:55:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 23:55:14,509 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 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) Word has length 51 [2023-12-24 23:55:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:55:14,510 INFO L225 Difference]: With dead ends: 513 [2023-12-24 23:55:14,510 INFO L226 Difference]: Without dead ends: 291 [2023-12-24 23:55:14,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-12-24 23:55:14,512 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-24 23:55:14,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 439 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2023-12-24 23:55:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-12-24 23:55:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2023-12-24 23:55:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.3183391003460208) internal successors, (381), 289 states have internal predecessors, (381), 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-24 23:55:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 381 transitions. [2023-12-24 23:55:14,522 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 381 transitions. Word has length 51 [2023-12-24 23:55:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:55:14,522 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 381 transitions. [2023-12-24 23:55:14,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 17 states have internal predecessors, (70), 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-24 23:55:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 381 transitions. [2023-12-24 23:55:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-24 23:55:14,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:55:14,523 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:55:14,535 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-24 23:55:14,729 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-24 23:55:14,730 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:55:14,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:55:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -604263714, now seen corresponding path program 1 times [2023-12-24 23:55:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:55:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472323962] [2023-12-24 23:55:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:55:14,730 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-24 23:55:14,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:55:14,731 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:55:14,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 23:55:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:55:15,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 23:55:15,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:55:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:16,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:55:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-12-24 23:55:17,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:55:17,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472323962] [2023-12-24 23:55:17,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472323962] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:55:17,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:55:17,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4] total 19 [2023-12-24 23:55:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564809146] [2023-12-24 23:55:17,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:55:17,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 23:55:17,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:55:17,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 23:55:17,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-12-24 23:55:17,219 INFO L87 Difference]: Start difference. First operand 290 states and 381 transitions. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 19 states have internal predecessors, (77), 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-24 23:55:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:55:18,269 INFO L93 Difference]: Finished difference Result 420 states and 568 transitions. [2023-12-24 23:55:18,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-24 23:55:18,279 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 19 states have internal predecessors, (77), 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) Word has length 57 [2023-12-24 23:55:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:55:18,280 INFO L225 Difference]: With dead ends: 420 [2023-12-24 23:55:18,280 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 23:55:18,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-12-24 23:55:18,281 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 23:55:18,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 23:55:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 23:55:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 23:55:18,282 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-24 23:55:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 23:55:18,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2023-12-24 23:55:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:55:18,282 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 23:55:18,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 19 states have internal predecessors, (77), 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-24 23:55:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 23:55:18,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 23:55:18,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 23:55:18,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 23:55:18,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:55:18,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 36) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 36) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 36) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 16 41) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 36) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 23 36) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 36) no Hoare annotation was computed. [2023-12-24 23:55:22,888 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 36) no Hoare annotation was computed. [2023-12-24 23:55:22,889 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 39) the Hoare annotation is: (= (bvadd |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~v4~0#1| |ULTIMATE.start_main_~v3~0#1| |ULTIMATE.start_main_~v2~0#1| |ULTIMATE.start_main_~v1~0#1|) |ULTIMATE.start_main_~l~0#1|) [2023-12-24 23:55:22,889 INFO L899 garLoopResultBuilder]: For program point L21-3(lines 21 39) no Hoare annotation was computed. [2023-12-24 23:55:22,889 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 23:55:22,889 INFO L899 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2023-12-24 23:55:22,889 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2023-12-24 23:55:22,889 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2023-12-24 23:55:22,891 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:55:22,892 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 23:55:22,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 11:55:22 BoogieIcfgContainer [2023-12-24 23:55:22,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 23:55:22,900 INFO L158 Benchmark]: Toolchain (without parser) took 110992.83ms. Allocated memory was 291.5MB in the beginning and 350.2MB in the end (delta: 58.7MB). Free memory was 238.6MB in the beginning and 135.2MB in the end (delta: 103.5MB). Peak memory consumption was 162.7MB. Max. memory is 8.0GB. [2023-12-24 23:55:22,900 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 23:55:22,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.76ms. Allocated memory is still 291.5MB. Free memory was 238.6MB in the beginning and 227.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 23:55:22,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.50ms. Allocated memory is still 291.5MB. Free memory was 227.0MB in the beginning and 225.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 23:55:22,901 INFO L158 Benchmark]: Boogie Preprocessor took 45.40ms. Allocated memory is still 291.5MB. Free memory was 225.5MB in the beginning and 223.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 23:55:22,901 INFO L158 Benchmark]: RCFGBuilder took 485.78ms. Allocated memory is still 291.5MB. Free memory was 223.5MB in the beginning and 209.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 23:55:22,902 INFO L158 Benchmark]: TraceAbstraction took 110255.92ms. Allocated memory was 291.5MB in the beginning and 350.2MB in the end (delta: 58.7MB). Free memory was 208.8MB in the beginning and 135.2MB in the end (delta: 73.6MB). Peak memory consumption was 133.4MB. Max. memory is 8.0GB. [2023-12-24 23:55:22,903 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.12ms. Allocated memory is still 181.4MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.76ms. Allocated memory is still 291.5MB. Free memory was 238.6MB in the beginning and 227.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.50ms. Allocated memory is still 291.5MB. Free memory was 227.0MB in the beginning and 225.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.40ms. Allocated memory is still 291.5MB. Free memory was 225.5MB in the beginning and 223.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 485.78ms. Allocated memory is still 291.5MB. Free memory was 223.5MB in the beginning and 209.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 110255.92ms. Allocated memory was 291.5MB in the beginning and 350.2MB in the end (delta: 58.7MB). Free memory was 208.8MB in the beginning and 135.2MB in the end (delta: 73.6MB). Peak memory consumption was 133.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: 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 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 110.2s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 88.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 81.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 79.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 425 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2589 IncrementalHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 82 mSDtfsCounter, 2589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=7, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 25 NumberOfFragments, 10 HoareAnnotationTreeSize, 1 FormulaSimplifications, 172 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 625 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 590 ConstructedInterpolants, 0 QuantifiedInterpolants, 8317 SizeOfPredicates, 63 NumberOfNonLiveVariables, 699 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 367/836 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: 21]: Loop Invariant Derived loop invariant: (((k + j) % 4294967296) == l) RESULT: Ultimate proved your program to be correct! [2023-12-24 23:55:22,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...