/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/sumt8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 23:53:39,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 23:53:39,849 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:39,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 23:53:39,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 23:53:39,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 23:53:39,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 23:53:39,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 23:53:39,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 23:53:39,877 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 23:53:39,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 23:53:39,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 23:53:39,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 23:53:39,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 23:53:39,879 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 23:53:39,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 23:53:39,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 23:53:39,880 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 23:53:39,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 23:53:39,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 23:53:39,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 23:53:39,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 23:53:39,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 23:53:39,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 23:53:39,881 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 23:53:39,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 23:53:39,881 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 23:53:39,882 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 23:53:39,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 23:53:39,882 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 23:53:39,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 23:53:39,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 23:53:39,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 23:53:39,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 23:53:39,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:53:39,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 23:53:39,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 23:53:39,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 23:53:39,883 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 23:53:39,883 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 23:53:39,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 23:53:39,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 23:53:39,884 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 23:53:39,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 23:53:39,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 23:53:39,884 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 23:53:39,884 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:40,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 23:53:40,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 23:53:40,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 23:53:40,078 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 23:53:40,078 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 23:53:40,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c [2023-12-24 23:53:41,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 23:53:41,156 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 23:53:41,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c [2023-12-24 23:53:41,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfc2435b/06b43b235cbc485685b7d9f9fbdb7fc0/FLAGcd7bae331 [2023-12-24 23:53:41,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdfc2435b/06b43b235cbc485685b7d9f9fbdb7fc0 [2023-12-24 23:53:41,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 23:53:41,172 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 23:53:41,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 23:53:41,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 23:53:41,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 23:53:41,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:53:41" (1/1) ... [2023-12-24 23:53:41,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a052048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:41, skipping insertion in model container [2023-12-24 23:53:41,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:53:41" (1/1) ... [2023-12-24 23:53:41,194 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 23:53:41,312 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/sumt8.c[403,416] [2023-12-24 23:53:41,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:53:41,341 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 23:53:41,354 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/sumt8.c[403,416] [2023-12-24 23:53:41,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:53:41,379 INFO L206 MainTranslator]: Completed translation [2023-12-24 23:53:41,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:41 WrapperNode [2023-12-24 23:53:41,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 23:53:41,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 23:53:41,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 23:53:41,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 23:53:41,386 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:41" (1/1) ... [2023-12-24 23:53:41,392 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:41" (1/1) ... [2023-12-24 23:53:41,408 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2023-12-24 23:53:41,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 23:53:41,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 23:53:41,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 23:53:41,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 23:53:41,416 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:41" (1/1) ... [2023-12-24 23:53:41,416 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:41" (1/1) ... [2023-12-24 23:53:41,425 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:41" (1/1) ... [2023-12-24 23:53:41,438 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:41,438 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:41" (1/1) ... [2023-12-24 23:53:41,438 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:41" (1/1) ... [2023-12-24 23:53:41,448 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:41" (1/1) ... [2023-12-24 23:53:41,450 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:41" (1/1) ... [2023-12-24 23:53:41,451 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:41" (1/1) ... [2023-12-24 23:53:41,451 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:41" (1/1) ... [2023-12-24 23:53:41,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 23:53:41,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 23:53:41,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 23:53:41,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 23:53:41,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:41" (1/1) ... [2023-12-24 23:53:41,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:53:41,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 23:53:41,476 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:41,500 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:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 23:53:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 23:53:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 23:53:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 23:53:41,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 23:53:41,556 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 23:53:41,558 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 23:53:41,846 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 23:53:41,868 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 23:53:41,868 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 23:53:41,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:53:41 BoogieIcfgContainer [2023-12-24 23:53:41,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 23:53:41,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 23:53:41,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 23:53:41,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 23:53:41,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 11:53:41" (1/3) ... [2023-12-24 23:53:41,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e670e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:53:41, skipping insertion in model container [2023-12-24 23:53:41,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:53:41" (2/3) ... [2023-12-24 23:53:41,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e670e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:53:41, skipping insertion in model container [2023-12-24 23:53:41,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:53:41" (3/3) ... [2023-12-24 23:53:41,874 INFO L112 eAbstractionObserver]: Analyzing ICFG sumt8.c [2023-12-24 23:53:41,884 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 23:53:41,885 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 23:53:41,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 23:53:41,927 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;@32e76d8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 23:53:41,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 23:53:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 23:53:41,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:53:41,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:53:41,937 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:53:41,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:53:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1434365076, now seen corresponding path program 1 times [2023-12-24 23:53:41,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:53:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159408303] [2023-12-24 23:53:41,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:53:41,950 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:41,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:53:41,952 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:41,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 23:53:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:53:42,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 23:53:42,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:53:42,394 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:42,394 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 23:53:42,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:53:42,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159408303] [2023-12-24 23:53:42,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159408303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 23:53:42,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 23:53:42,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 23:53:42,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379468784] [2023-12-24 23:53:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 23:53:42,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 23:53:42,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:53:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 23:53:42,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 23:53:42,425 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:53:42,625 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2023-12-24 23:53:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 23:53:42,630 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:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:53:42,635 INFO L225 Difference]: With dead ends: 41 [2023-12-24 23:53:42,635 INFO L226 Difference]: Without dead ends: 20 [2023-12-24 23:53:42,637 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:42,639 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 23:53:42,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 23:53:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-24 23:53:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2023-12-24 23:53:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 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:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2023-12-24 23:53:42,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 7 [2023-12-24 23:53:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:53:42,659 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2023-12-24 23:53:42,659 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:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2023-12-24 23:53:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 23:53:42,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:53:42,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:53:42,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 23:53:42,862 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:42,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:53:42,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:53:42,863 INFO L85 PathProgramCache]: Analyzing trace with hash -83806977, now seen corresponding path program 1 times [2023-12-24 23:53:42,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:53:42,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333989824] [2023-12-24 23:53:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:53:42,863 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:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:53:42,864 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:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:53:42,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 23:53:42,893 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:42,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:53:42,911 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:42,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:53:42,932 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:42,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:53:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333989824] [2023-12-24 23:53:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333989824] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:53:42,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:53:42,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 23:53:42,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203217010] [2023-12-24 23:53:42,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:53:42,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 23:53:42,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:53:42,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 23:53:42,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 23:53:42,934 INFO L87 Difference]: Start difference. First operand 19 states and 26 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:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:53:43,331 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2023-12-24 23:53:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 23:53:43,332 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:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:53:43,332 INFO L225 Difference]: With dead ends: 62 [2023-12-24 23:53:43,332 INFO L226 Difference]: Without dead ends: 49 [2023-12-24 23:53:43,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 23:53:43,334 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 23:53:43,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 23 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 23:53:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-24 23:53:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2023-12-24 23:53:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 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,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2023-12-24 23:53:43,345 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 12 [2023-12-24 23:53:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:53:43,346 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2023-12-24 23:53:43,346 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:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2023-12-24 23:53:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-24 23:53:43,346 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:53:43,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:53:43,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 23:53:43,549 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:43,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:53:43,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:53:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1221252366, now seen corresponding path program 1 times [2023-12-24 23:53:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:53:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690158883] [2023-12-24 23:53:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:53:43,550 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:43,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:53:43,551 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:43,552 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:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:53:43,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 23:53:43,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:53:44,117 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:44,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:53:44,455 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:44,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:53:44,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690158883] [2023-12-24 23:53:44,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690158883] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:53:44,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:53:44,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2023-12-24 23:53:44,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204141195] [2023-12-24 23:53:44,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:53:44,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 23:53:44,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:53:44,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 23:53:44,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-24 23:53:44,458 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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:48,677 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:52,743 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:56,814 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:00,871 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:04,915 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:08,993 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:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:54:09,220 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2023-12-24 23:54:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 23:54:09,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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 18 [2023-12-24 23:54:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:54:09,221 INFO L225 Difference]: With dead ends: 62 [2023-12-24 23:54:09,221 INFO L226 Difference]: Without dead ends: 60 [2023-12-24 23:54:09,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 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:54:09,223 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:09,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 24.7s Time] [2023-12-24 23:54:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-24 23:54:09,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-24 23:54:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 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:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2023-12-24 23:54:09,230 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 18 [2023-12-24 23:54:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:54:09,231 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2023-12-24 23:54:09,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2023-12-24 23:54:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 23:54:09,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:09,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:09,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 23:54:09,432 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:09,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:09,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:09,435 INFO L85 PathProgramCache]: Analyzing trace with hash -562379565, now seen corresponding path program 1 times [2023-12-24 23:54:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:09,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209518623] [2023-12-24 23:54:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:09,435 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,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:09,436 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:09,439 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:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:09,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 23:54:09,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:09,546 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:09,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:10,607 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:10,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:10,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209518623] [2023-12-24 23:54:10,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209518623] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:10,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:10,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 23:54:10,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050813085] [2023-12-24 23:54:10,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:10,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 23:54:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:10,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 23:54:10,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-24 23:54:10,610 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:54:16,090 INFO L93 Difference]: Finished difference Result 124 states and 170 transitions. [2023-12-24 23:54:16,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 23:54:16,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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 24 [2023-12-24 23:54:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:54:16,094 INFO L225 Difference]: With dead ends: 124 [2023-12-24 23:54:16,094 INFO L226 Difference]: Without dead ends: 90 [2023-12-24 23:54:16,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-24 23:54:16,095 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:16,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 36 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-24 23:54:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-24 23:54:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2023-12-24 23:54:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 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:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2023-12-24 23:54:16,102 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 24 [2023-12-24 23:54:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:54:16,103 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2023-12-24 23:54:16,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2023-12-24 23:54:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 23:54:16,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:16,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:16,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-24 23:54:16,308 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:16,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:16,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash -92433514, now seen corresponding path program 1 times [2023-12-24 23:54:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640810964] [2023-12-24 23:54:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:16,310 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:16,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:16,311 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:16,312 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:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:16,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 23:54:16,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:17,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-24 23:54:17,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:17,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640810964] [2023-12-24 23:54:17,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640810964] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:17,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2023-12-24 23:54:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505652824] [2023-12-24 23:54:17,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:17,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 23:54:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:17,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 23:54:17,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:54:17,800 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 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:22,144 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:26,195 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:30,227 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:34,265 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:38,604 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:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:54:38,633 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2023-12-24 23:54:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 23:54:38,636 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 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 29 [2023-12-24 23:54:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:54:38,640 INFO L225 Difference]: With dead ends: 127 [2023-12-24 23:54:38,640 INFO L226 Difference]: Without dead ends: 125 [2023-12-24 23:54:38,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 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:38,642 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:38,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 5 Unknown, 0 Unchecked, 20.7s Time] [2023-12-24 23:54:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-24 23:54:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-12-24 23:54:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.314516129032258) internal successors, (163), 124 states have internal predecessors, (163), 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,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2023-12-24 23:54:38,650 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 29 [2023-12-24 23:54:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:54:38,650 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2023-12-24 23:54:38,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 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,651 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2023-12-24 23:54:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 23:54:38,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:38,651 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:38,657 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:38,857 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:38,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:38,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1578473256, now seen corresponding path program 1 times [2023-12-24 23:54:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:38,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579806242] [2023-12-24 23:54:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:38,860 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:38,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:38,863 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:38,863 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:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:38,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 23:54:38,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:39,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:40,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:40,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579806242] [2023-12-24 23:54:40,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579806242] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:40,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:40,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-24 23:54:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628660837] [2023-12-24 23:54:40,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:40,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 23:54:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 23:54:40,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-24 23:54:40,589 INFO L87 Difference]: Start difference. First operand 125 states and 163 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 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:46,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:54:50,775 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:54,777 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:59,699 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:03,702 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:09,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:13,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:15,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:16,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:55:16,604 INFO L93 Difference]: Finished difference Result 295 states and 405 transitions. [2023-12-24 23:55:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 23:55:16,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 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:55:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:55:16,607 INFO L225 Difference]: With dead ends: 295 [2023-12-24 23:55:16,607 INFO L226 Difference]: Without dead ends: 206 [2023-12-24 23:55:16,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-12-24 23:55:16,609 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 34 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2023-12-24 23:55:16,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 53 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 31.9s Time] [2023-12-24 23:55:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-24 23:55:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2023-12-24 23:55:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 188 states have internal predecessors, (260), 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:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 260 transitions. [2023-12-24 23:55:16,621 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 260 transitions. Word has length 36 [2023-12-24 23:55:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:55:16,621 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 260 transitions. [2023-12-24 23:55:16,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 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:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 260 transitions. [2023-12-24 23:55:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-24 23:55:16,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:55:16,622 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:55:16,632 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:55:16,829 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:55:16,829 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:55:16,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:55:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1720718255, now seen corresponding path program 1 times [2023-12-24 23:55:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:55:16,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522350649] [2023-12-24 23:55:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:55:16,830 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:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:55:16,831 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:55:16,832 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:55:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:55:16,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 23:55:16,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:55:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:18,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:55:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 23:55:18,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:55:18,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522350649] [2023-12-24 23:55:18,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522350649] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:55:18,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:55:18,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2023-12-24 23:55:18,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367725255] [2023-12-24 23:55:18,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:55:18,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 23:55:18,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:55:18,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 23:55:18,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-24 23:55:18,703 INFO L87 Difference]: Start difference. First operand 189 states and 260 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 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:23,237 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:27,288 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:31,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:35,683 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:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:55:35,703 INFO L93 Difference]: Finished difference Result 238 states and 332 transitions. [2023-12-24 23:55:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 23:55:35,708 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 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 39 [2023-12-24 23:55:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:55:35,709 INFO L225 Difference]: With dead ends: 238 [2023-12-24 23:55:35,709 INFO L226 Difference]: Without dead ends: 236 [2023-12-24 23:55:35,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-12-24 23:55:35,710 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2023-12-24 23:55:35,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 48 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 319 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2023-12-24 23:55:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-24 23:55:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2023-12-24 23:55:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.3787234042553191) internal successors, (324), 235 states have internal predecessors, (324), 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:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 324 transitions. [2023-12-24 23:55:35,722 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 324 transitions. Word has length 39 [2023-12-24 23:55:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:55:35,723 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 324 transitions. [2023-12-24 23:55:35,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 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:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 324 transitions. [2023-12-24 23:55:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-24 23:55:35,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:55:35,724 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:55:35,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 23:55:35,931 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:55:35,931 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:55:35,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:55:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash -57827183, now seen corresponding path program 1 times [2023-12-24 23:55:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:55:35,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448489017] [2023-12-24 23:55:35,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:55:35,932 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:35,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:55:35,933 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:55:35,935 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:55:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:55:36,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 23:55:36,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:55:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:36,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:55:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:38,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:55:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448489017] [2023-12-24 23:55:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448489017] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:55:38,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:55:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 23:55:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582583639] [2023-12-24 23:55:38,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:55:38,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 23:55:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:55:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 23:55:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:55:38,522 INFO L87 Difference]: Start difference. First operand 236 states and 324 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 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:44,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:48,328 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:52,331 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:56,333 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:56:00,336 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:56:04,338 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:56:08,374 WARN L854 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (bvurem (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1|) (_ bv5 32)))) (not (= (bvurem (bvadd |c_ULTIMATE.start_main_~l~0#1| (_ bv1 32)) (_ bv5 32)) (_ bv0 32))) (not (= (bvurem |c_ULTIMATE.start_main_~l~0#1| (_ bv5 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~l~0#1|) (_ bv5 32)))) (not (= (_ bv0 32) (bvurem (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~l~0#1|) (_ bv5 32))))) is different from false [2023-12-24 23:56:14,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:19,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:56:22,564 INFO L93 Difference]: Finished difference Result 654 states and 923 transitions. [2023-12-24 23:56:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 23:56:22,582 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 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 47 [2023-12-24 23:56:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:56:22,583 INFO L225 Difference]: With dead ends: 654 [2023-12-24 23:56:22,583 INFO L226 Difference]: Without dead ends: 463 [2023-12-24 23:56:22,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=91, Invalid=218, Unknown=1, NotChecked=32, Total=342 [2023-12-24 23:56:22,586 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 125 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 35.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:56:22,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 74 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 6 Unknown, 19 Unchecked, 35.0s Time] [2023-12-24 23:56:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-12-24 23:56:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 439. [2023-12-24 23:56:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.3926940639269407) internal successors, (610), 438 states have internal predecessors, (610), 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:56:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 610 transitions. [2023-12-24 23:56:22,606 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 610 transitions. Word has length 47 [2023-12-24 23:56:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:56:22,606 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 610 transitions. [2023-12-24 23:56:22,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 11 states have internal predecessors, (91), 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:56:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 610 transitions. [2023-12-24 23:56:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-24 23:56:22,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:56:22,607 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:56:22,621 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:56:22,816 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:56:22,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:56:22,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:56:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1791215592, now seen corresponding path program 1 times [2023-12-24 23:56:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:56:22,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830661631] [2023-12-24 23:56:22,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:56:22,817 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:56:22,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:56:22,818 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:56:22,819 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:56:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:56:23,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 23:56:23,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:56:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:56:24,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:56:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-24 23:56:25,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:56:25,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830661631] [2023-12-24 23:56:25,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830661631] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:56:25,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:56:25,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 15 [2023-12-24 23:56:25,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710117696] [2023-12-24 23:56:25,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:56:25,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 23:56:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:56:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 23:56:25,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-24 23:56:25,136 INFO L87 Difference]: Start difference. First operand 439 states and 610 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 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:56:29,760 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:56:34,006 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:56:38,178 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:56:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:56:38,272 INFO L93 Difference]: Finished difference Result 567 states and 799 transitions. [2023-12-24 23:56:38,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 23:56:38,277 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 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 48 [2023-12-24 23:56:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:56:38,279 INFO L225 Difference]: With dead ends: 567 [2023-12-24 23:56:38,279 INFO L226 Difference]: Without dead ends: 565 [2023-12-24 23:56:38,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-12-24 23:56:38,281 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2023-12-24 23:56:38,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 48 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 353 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2023-12-24 23:56:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2023-12-24 23:56:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2023-12-24 23:56:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.3900709219858156) internal successors, (784), 564 states have internal predecessors, (784), 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:56:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 784 transitions. [2023-12-24 23:56:38,298 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 784 transitions. Word has length 48 [2023-12-24 23:56:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:56:38,299 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 784 transitions. [2023-12-24 23:56:38,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 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:56:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 784 transitions. [2023-12-24 23:56:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-24 23:56:38,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:56:38,300 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:56:38,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 23:56:38,503 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:56:38,504 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:56:38,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:56:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1173277352, now seen corresponding path program 1 times [2023-12-24 23:56:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:56:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127760327] [2023-12-24 23:56:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:56:38,505 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:56:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:56:38,506 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:56:38,509 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:56:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:56:38,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 23:56:38,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:56:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:56:40,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:56:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-24 23:56:41,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:56:41,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127760327] [2023-12-24 23:56:41,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127760327] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:56:41,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:56:41,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 4] total 17 [2023-12-24 23:56:41,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149132643] [2023-12-24 23:56:41,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:56:41,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 23:56:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:56:41,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 23:56:41,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-24 23:56:41,278 INFO L87 Difference]: Start difference. First operand 565 states and 784 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 17 states have internal predecessors, (76), 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:56:46,129 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:56:50,201 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:56:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:56:50,540 INFO L93 Difference]: Finished difference Result 1124 states and 1599 transitions. [2023-12-24 23:56:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 23:56:50,544 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 17 states have internal predecessors, (76), 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 56 [2023-12-24 23:56:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:56:50,546 INFO L225 Difference]: With dead ends: 1124 [2023-12-24 23:56:50,546 INFO L226 Difference]: Without dead ends: 620 [2023-12-24 23:56:50,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-12-24 23:56:50,547 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-12-24 23:56:50,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 72 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 550 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2023-12-24 23:56:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2023-12-24 23:56:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2023-12-24 23:56:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.3877221324717286) internal successors, (859), 619 states have internal predecessors, (859), 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:56:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 859 transitions. [2023-12-24 23:56:50,572 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 859 transitions. Word has length 56 [2023-12-24 23:56:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:56:50,573 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 859 transitions. [2023-12-24 23:56:50,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 17 states have internal predecessors, (76), 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:56:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 859 transitions. [2023-12-24 23:56:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-24 23:56:50,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:56:50,577 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:56:50,591 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:56:50,788 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:56:50,789 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:56:50,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:56:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1678132637, now seen corresponding path program 1 times [2023-12-24 23:56:50,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:56:50,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927708547] [2023-12-24 23:56:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:56:50,790 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:56:50,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:56:50,791 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:56:50,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 23:56:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:56:51,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 23:56:51,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:56:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:56:51,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:56:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:56:54,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:56:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927708547] [2023-12-24 23:56:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927708547] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:56:54,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:56:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-24 23:56:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805998992] [2023-12-24 23:56:54,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:56:54,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 23:56:54,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:56:54,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 23:56:54,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-12-24 23:56:54,547 INFO L87 Difference]: Start difference. First operand 620 states and 859 transitions. Second operand has 16 states, 16 states have (on average 7.5625) internal successors, (121), 15 states have internal predecessors, (121), 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:57:01,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:05,476 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:57:09,478 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:57:13,481 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:57:17,483 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:57:21,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:57:25,490 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:57:29,493 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:57:33,543 WARN L854 $PredicateComparison]: unable to prove that (and (not (= (bvurem |c_ULTIMATE.start_main_~l~0#1| (_ bv7 32)) (_ bv0 32))) (not (= (bvurem (bvadd |c_ULTIMATE.start_main_~l~0#1| (_ bv5 32)) (_ bv7 32)) (_ bv0 32))) (not (= (_ bv0 32) (bvurem (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1|) (_ bv7 32)))) (not (= (bvurem (bvadd (_ bv6 32) |c_ULTIMATE.start_main_~l~0#1|) (_ bv7 32)) (_ bv0 32))) (not (= (bvurem (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~l~0#1|) (_ bv7 32)) (_ bv0 32))) (not (= (bvurem (bvadd |c_ULTIMATE.start_main_~l~0#1| (_ bv1 32)) (_ bv7 32)) (_ bv0 32))) (not (= (bvurem (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~l~0#1|) (_ bv7 32)) (_ bv0 32)))) is different from false [2023-12-24 23:57:44,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:50,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:56,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:01,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:05,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:06,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:08,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:10,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:12,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:14,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:21,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:27,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:34,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:58:36,236 INFO L93 Difference]: Finished difference Result 1866 states and 2678 transitions. [2023-12-24 23:58:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 23:58:36,252 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 15 states have internal predecessors, (121), 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 62 [2023-12-24 23:58:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:58:36,258 INFO L225 Difference]: With dead ends: 1866 [2023-12-24 23:58:36,258 INFO L226 Difference]: Without dead ends: 1306 [2023-12-24 23:58:36,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=211, Invalid=548, Unknown=1, NotChecked=52, Total=812 [2023-12-24 23:58:36,260 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 300 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 10 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 80.2s IncrementalHoareTripleChecker+Time [2023-12-24 23:58:36,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 96 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 302 Invalid, 13 Unknown, 10 Unchecked, 80.2s Time] [2023-12-24 23:58:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2023-12-24 23:58:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1276. [2023-12-24 23:58:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 1.4015686274509804) internal successors, (1787), 1275 states have internal predecessors, (1787), 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:58:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1787 transitions. [2023-12-24 23:58:36,300 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1787 transitions. Word has length 62 [2023-12-24 23:58:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:58:36,301 INFO L495 AbstractCegarLoop]: Abstraction has 1276 states and 1787 transitions. [2023-12-24 23:58:36,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 15 states have internal predecessors, (121), 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:58:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1787 transitions. [2023-12-24 23:58:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-24 23:58:36,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:58:36,303 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:58:36,317 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 (12)] Ended with exit code 0 [2023-12-24 23:58:36,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:58:36,507 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:58:36,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:58:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash 483633366, now seen corresponding path program 1 times [2023-12-24 23:58:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:58:36,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181467553] [2023-12-24 23:58:36,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:58:36,508 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:58:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:58:36,509 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:58:36,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 23:58:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:58:36,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-24 23:58:36,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:58:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:58:38,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:58:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2023-12-24 23:58:39,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:58:39,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181467553] [2023-12-24 23:58:39,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181467553] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:58:39,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:58:39,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4] total 19 [2023-12-24 23:58:39,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629492166] [2023-12-24 23:58:39,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:58:39,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 23:58:39,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:58:39,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 23:58:39,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-12-24 23:58:39,687 INFO L87 Difference]: Start difference. First operand 1276 states and 1787 transitions. Second operand has 20 states, 20 states have (on average 4.2) internal successors, (84), 19 states have internal predecessors, (84), 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:58:44,724 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:58:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:58:45,163 INFO L93 Difference]: Finished difference Result 1669 states and 2362 transitions. [2023-12-24 23:58:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 23:58:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.2) internal successors, (84), 19 states have internal predecessors, (84), 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 63 [2023-12-24 23:58:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:58:45,178 INFO L225 Difference]: With dead ends: 1669 [2023-12-24 23:58:45,178 INFO L226 Difference]: Without dead ends: 1667 [2023-12-24 23:58:45,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-12-24 23:58:45,180 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-24 23:58:45,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 89 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 662 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-12-24 23:58:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2023-12-24 23:58:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2023-12-24 23:58:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1666 states have (on average 1.3865546218487395) internal successors, (2310), 1666 states have internal predecessors, (2310), 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:58:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2310 transitions. [2023-12-24 23:58:45,229 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2310 transitions. Word has length 63 [2023-12-24 23:58:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:58:45,229 INFO L495 AbstractCegarLoop]: Abstraction has 1667 states and 2310 transitions. [2023-12-24 23:58:45,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.2) internal successors, (84), 19 states have internal predecessors, (84), 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:58:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2310 transitions. [2023-12-24 23:58:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-24 23:58:45,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:58:45,230 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:58:45,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 23:58:45,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:58:45,448 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:58:45,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:58:45,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1556634981, now seen corresponding path program 1 times [2023-12-24 23:58:45,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:58:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740554147] [2023-12-24 23:58:45,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:58:45,449 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:58:45,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:58:45,450 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:58:45,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 23:58:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:58:45,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 23:58:45,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:58:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:58:47,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:58:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-12-24 23:58:48,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:58:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740554147] [2023-12-24 23:58:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740554147] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:58:48,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:58:48,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 21 [2023-12-24 23:58:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010459387] [2023-12-24 23:58:48,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:58:48,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-24 23:58:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:58:48,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-24 23:58:48,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2023-12-24 23:58:48,916 INFO L87 Difference]: Start difference. First operand 1667 states and 2310 transitions. Second operand has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 21 states have internal predecessors, (91), 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:58:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:58:50,193 INFO L93 Difference]: Finished difference Result 2709 states and 3801 transitions. [2023-12-24 23:58:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-24 23:58:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 21 states have internal predecessors, (91), 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 69 [2023-12-24 23:58:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:58:50,199 INFO L225 Difference]: With dead ends: 2709 [2023-12-24 23:58:50,199 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 23:58:50,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2023-12-24 23:58:50,202 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 23:58:50,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 23:58:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 23:58:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 23:58:50,202 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:58:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 23:58:50,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2023-12-24 23:58:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:58:50,203 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 23:58:50,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 21 states have internal predecessors, (91), 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:58:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 23:58:50,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 23:58:50,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 23:58:50,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 23:58:50,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:58:50,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 23:59:03,436 WARN L293 SmtUtils]: Spent 12.61s on a formula simplification. DAG size of input: 232 DAG size of output: 11 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 23:59:03,439 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 23 38) no Hoare annotation was computed. [2023-12-24 23:59:03,439 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 38) no Hoare annotation was computed. [2023-12-24 23:59:03,439 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 38) no Hoare annotation was computed. [2023-12-24 23:59:03,439 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 38) no Hoare annotation was computed. [2023-12-24 23:59:03,440 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 16 43) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 38) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 38) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 38) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 41) 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_~v5~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:59:03,441 INFO L899 garLoopResultBuilder]: For program point L21-3(lines 21 41) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2023-12-24 23:59:03,441 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 38) no Hoare annotation was computed. [2023-12-24 23:59:03,443 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:59:03,444 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 23:59:03,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 11:59:03 BoogieIcfgContainer [2023-12-24 23:59:03,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 23:59:03,452 INFO L158 Benchmark]: Toolchain (without parser) took 322279.24ms. Allocated memory was 220.2MB in the beginning and 286.3MB in the end (delta: 66.1MB). Free memory was 161.0MB in the beginning and 251.0MB in the end (delta: -90.0MB). Peak memory consumption was 150.1MB. Max. memory is 8.0GB. [2023-12-24 23:59:03,452 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 220.2MB. Free memory was 171.2MB in the beginning and 171.1MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 23:59:03,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.16ms. Allocated memory is still 220.2MB. Free memory was 160.6MB in the beginning and 149.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 23:59:03,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.92ms. Allocated memory is still 220.2MB. Free memory was 148.7MB in the beginning and 147.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 23:59:03,452 INFO L158 Benchmark]: Boogie Preprocessor took 43.43ms. Allocated memory is still 220.2MB. Free memory was 147.4MB in the beginning and 145.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 23:59:03,452 INFO L158 Benchmark]: RCFGBuilder took 415.58ms. Allocated memory is still 220.2MB. Free memory was 145.3MB in the beginning and 131.9MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 23:59:03,453 INFO L158 Benchmark]: TraceAbstraction took 321581.62ms. Allocated memory was 220.2MB in the beginning and 286.3MB in the end (delta: 66.1MB). Free memory was 130.9MB in the beginning and 251.0MB in the end (delta: -120.1MB). Peak memory consumption was 119.7MB. Max. memory is 8.0GB. [2023-12-24 23:59:03,453 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 220.2MB. Free memory was 171.2MB in the beginning and 171.1MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.16ms. Allocated memory is still 220.2MB. Free memory was 160.6MB in the beginning and 149.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.92ms. Allocated memory is still 220.2MB. Free memory was 148.7MB in the beginning and 147.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.43ms. Allocated memory is still 220.2MB. Free memory was 147.4MB in the beginning and 145.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 415.58ms. Allocated memory is still 220.2MB. Free memory was 145.3MB in the beginning and 131.9MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 321581.62ms. Allocated memory was 220.2MB in the beginning and 286.3MB in the end (delta: 66.1MB). Free memory was 130.9MB in the beginning and 251.0MB in the end (delta: -120.1MB). Peak memory consumption was 119.7MB. 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 321.5s, OverallIterations: 13, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 279.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 45 mSolverCounterUnknown, 728 SdHoareTripleChecker+Valid, 241.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 728 mSDsluCounter, 722 SdHoareTripleChecker+Invalid, 237.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 29 IncrementalHoareTripleChecker+Unchecked, 591 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3967 IncrementalHoareTripleChecker+Invalid, 4158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 131 mSDtfsCounter, 3967 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1054 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 45.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1667occurred in iteration=12, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 142 NumberOfFragments, 11 HoareAnnotationTreeSize, 1 FormulaSimplifications, 338 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 1 FormulaSimplificationsInter, 7638 FormulaSimplificationTreeSizeReductionInter, 12.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 13735 SizeOfPredicates, 80 NumberOfNonLiveVariables, 1058 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 624/1716 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:59:03,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...