/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/array-fpi/eqn4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 20:23:19,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 20:23:20,015 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-21 20:23:20,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 20:23:20,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 20:23:20,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 20:23:20,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 20:23:20,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 20:23:20,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 20:23:20,050 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 20:23:20,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 20:23:20,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 20:23:20,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 20:23:20,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 20:23:20,051 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 20:23:20,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 20:23:20,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 20:23:20,051 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 20:23:20,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 20:23:20,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 20:23:20,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 20:23:20,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 20:23:20,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 20:23:20,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 20:23:20,053 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 20:23:20,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 20:23:20,054 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 20:23:20,054 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 20:23:20,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 20:23:20,054 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 20:23:20,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 20:23:20,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 20:23:20,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 20:23:20,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 20:23:20,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:23:20,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 20:23:20,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 20:23:20,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 20:23:20,056 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 20:23:20,056 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 20:23:20,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 20:23:20,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 20:23:20,057 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 20:23:20,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 20:23:20,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 20:23:20,057 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 20:23:20,057 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-21 20:23:20,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 20:23:20,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 20:23:20,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 20:23:20,270 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 20:23:20,270 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 20:23:20,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn4.c [2023-12-21 20:23:21,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 20:23:21,501 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 20:23:21,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn4.c [2023-12-21 20:23:21,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce90cea5b/4876fab7d23846b393c958cba4aa993b/FLAGb08506120 [2023-12-21 20:23:21,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce90cea5b/4876fab7d23846b393c958cba4aa993b [2023-12-21 20:23:21,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 20:23:21,522 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 20:23:21,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 20:23:21,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 20:23:21,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 20:23:21,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c9b453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21, skipping insertion in model container [2023-12-21 20:23:21,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,540 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 20:23:21,650 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn4.c[587,600] [2023-12-21 20:23:21,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:23:21,688 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 20:23:21,698 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn4.c[587,600] [2023-12-21 20:23:21,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:23:21,716 INFO L206 MainTranslator]: Completed translation [2023-12-21 20:23:21,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21 WrapperNode [2023-12-21 20:23:21,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 20:23:21,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 20:23:21,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 20:23:21,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 20:23:21,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,746 INFO L138 Inliner]: procedures = 18, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2023-12-21 20:23:21,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 20:23:21,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 20:23:21,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 20:23:21,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 20:23:21,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,777 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 7, 4, 4]. 41 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2023-12-21 20:23:21,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 20:23:21,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 20:23:21,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 20:23:21,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 20:23:21,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (1/1) ... [2023-12-21 20:23:21,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:23:21,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 20:23:21,855 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-21 20:23:21,873 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-21 20:23:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 20:23:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 20:23:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 20:23:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 20:23:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-21 20:23:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 20:23:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 20:23:21,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 20:23:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-21 20:23:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 20:23:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 20:23:21,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 20:23:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 20:23:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 20:23:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 20:23:21,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-21 20:23:21,934 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 20:23:21,939 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 20:23:22,103 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 20:23:22,125 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 20:23:22,125 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 20:23:22,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:23:22 BoogieIcfgContainer [2023-12-21 20:23:22,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 20:23:22,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 20:23:22,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 20:23:22,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 20:23:22,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:23:21" (1/3) ... [2023-12-21 20:23:22,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512520aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:23:22, skipping insertion in model container [2023-12-21 20:23:22,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:21" (2/3) ... [2023-12-21 20:23:22,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512520aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:23:22, skipping insertion in model container [2023-12-21 20:23:22,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:23:22" (3/3) ... [2023-12-21 20:23:22,131 INFO L112 eAbstractionObserver]: Analyzing ICFG eqn4.c [2023-12-21 20:23:22,143 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 20:23:22,143 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 20:23:22,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 20:23:22,184 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;@3f7fefae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 20:23:22,185 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 20:23:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 20:23:22,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:22,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:22,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:22,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash 955298750, now seen corresponding path program 1 times [2023-12-21 20:23:22,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:22,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540690474] [2023-12-21 20:23:22,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:23:22,209 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-21 20:23:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:22,211 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-21 20:23:22,243 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-21 20:23:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:23:22,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 20:23:22,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:22,370 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-21 20:23:22,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:23:22,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:22,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540690474] [2023-12-21 20:23:22,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540690474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:23:22,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:23:22,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 20:23:22,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276194306] [2023-12-21 20:23:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:23:22,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 20:23:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 20:23:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:23:22,399 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-21 20:23:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:23:22,434 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2023-12-21 20:23:22,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 20:23:22,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2023-12-21 20:23:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:23:22,440 INFO L225 Difference]: With dead ends: 29 [2023-12-21 20:23:22,440 INFO L226 Difference]: Without dead ends: 13 [2023-12-21 20:23:22,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:23:22,446 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:23:22,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:23:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-21 20:23:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-21 20:23:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-21 20:23:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-12-21 20:23:22,470 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2023-12-21 20:23:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:23:22,471 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-12-21 20:23:22,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-21 20:23:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-12-21 20:23:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 20:23:22,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:22,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:22,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 20:23:22,677 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-21 20:23:22,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:22,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1635357120, now seen corresponding path program 1 times [2023-12-21 20:23:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190373379] [2023-12-21 20:23:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:23:22,683 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-21 20:23:22,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:22,684 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-21 20:23:22,691 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-21 20:23:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:23:22,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 20:23:22,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:22,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:23:22,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:23:23,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:23:23,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 29 [2023-12-21 20:23:23,023 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-21 20:23:23,023 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:23:23,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:23,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190373379] [2023-12-21 20:23:23,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190373379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:23:23,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:23:23,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 20:23:23,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057710495] [2023-12-21 20:23:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:23:23,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 20:23:23,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:23,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 20:23:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 20:23:23,027 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-21 20:23:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:23:23,244 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-12-21 20:23:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 20:23:23,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2023-12-21 20:23:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:23:23,245 INFO L225 Difference]: With dead ends: 25 [2023-12-21 20:23:23,245 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 20:23:23,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 20:23:23,246 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:23:23,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 30 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 20:23:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 20:23:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2023-12-21 20:23:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-21 20:23:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-12-21 20:23:23,250 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2023-12-21 20:23:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:23:23,250 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-12-21 20:23:23,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-21 20:23:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-12-21 20:23:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 20:23:23,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:23,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:23,257 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-21 20:23:23,459 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-21 20:23:23,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:23,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash 265370671, now seen corresponding path program 1 times [2023-12-21 20:23:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308475757] [2023-12-21 20:23:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:23:23,461 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-21 20:23:23,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:23,463 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-21 20:23:23,485 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-21 20:23:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:23:23,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 20:23:23,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:23:23,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:23:23,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308475757] [2023-12-21 20:23:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308475757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:23:23,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:23:23,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 20:23:23,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504666958] [2023-12-21 20:23:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:23:23,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 20:23:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:23,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 20:23:23,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 20:23:23,691 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-21 20:23:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:23:23,942 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-12-21 20:23:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 20:23:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-21 20:23:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:23:23,943 INFO L225 Difference]: With dead ends: 32 [2023-12-21 20:23:23,943 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 20:23:23,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 20:23:23,944 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:23:23,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 20:23:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 20:23:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2023-12-21 20:23:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-21 20:23:23,949 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-12-21 20:23:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:23:23,949 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-21 20:23:23,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-21 20:23:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-21 20:23:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 20:23:23,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:23,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:23,962 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-21 20:23:24,153 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-21 20:23:24,154 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:24,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1093428625, now seen corresponding path program 1 times [2023-12-21 20:23:24,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:24,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396913209] [2023-12-21 20:23:24,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:23:24,155 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-21 20:23:24,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:24,157 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-21 20:23:24,157 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-21 20:23:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:23:24,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 20:23:24,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:24,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:23:24,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:23:24,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:23:24,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2023-12-21 20:23:24,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:23:24,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 29 [2023-12-21 20:23:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:23:24,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:23:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:23:25,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:25,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396913209] [2023-12-21 20:23:25,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396913209] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:23:25,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:23:25,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-21 20:23:25,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066654650] [2023-12-21 20:23:25,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:23:25,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 20:23:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 20:23:25,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-21 20:23:25,810 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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-21 20:23:30,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:23:34,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:23:40,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:23:47,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:23:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:23:48,120 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-12-21 20:23:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 20:23:48,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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 13 [2023-12-21 20:23:48,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:23:48,121 INFO L225 Difference]: With dead ends: 54 [2023-12-21 20:23:48,121 INFO L226 Difference]: Without dead ends: 52 [2023-12-21 20:23:48,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=87, Invalid=217, Unknown=2, NotChecked=0, Total=306 [2023-12-21 20:23:48,122 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:23:48,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 46 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2023-12-21 20:23:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-21 20:23:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 22. [2023-12-21 20:23:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 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-21 20:23:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-21 20:23:48,140 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2023-12-21 20:23:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:23:48,140 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-21 20:23:48,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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-21 20:23:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-21 20:23:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 20:23:48,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:48,141 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:48,148 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-21 20:23:48,347 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-21 20:23:48,347 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:48,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:48,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1115156774, now seen corresponding path program 1 times [2023-12-21 20:23:48,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:48,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670858263] [2023-12-21 20:23:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:23:48,348 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-21 20:23:48,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:48,350 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-21 20:23:48,351 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-21 20:23:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:23:48,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 20:23:48,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:23:48,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:23:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:23:48,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:48,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670858263] [2023-12-21 20:23:48,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670858263] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:23:48,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:23:48,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2023-12-21 20:23:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384558473] [2023-12-21 20:23:48,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:23:48,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 20:23:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 20:23:48,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-21 20:23:48,707 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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-21 20:23:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:23:49,048 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-12-21 20:23:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 20:23:49,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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 14 [2023-12-21 20:23:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:23:49,057 INFO L225 Difference]: With dead ends: 33 [2023-12-21 20:23:49,057 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 20:23:49,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-12-21 20:23:49,058 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:23:49,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 25 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 20:23:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 20:23:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2023-12-21 20:23:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:23:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-21 20:23:49,064 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2023-12-21 20:23:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:23:49,064 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-21 20:23:49,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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-21 20:23:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-21 20:23:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 20:23:49,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:49,065 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:49,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-21 20:23:49,270 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-21 20:23:49,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:49,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1687586673, now seen corresponding path program 2 times [2023-12-21 20:23:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:49,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597827861] [2023-12-21 20:23:49,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:23:49,271 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-21 20:23:49,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:49,273 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-21 20:23:49,274 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-21 20:23:49,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:23:49,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:23:49,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 20:23:49,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:23:49,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:23:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:23:49,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:49,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597827861] [2023-12-21 20:23:49,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597827861] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:23:49,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:23:49,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-21 20:23:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101549293] [2023-12-21 20:23:49,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:23:49,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 20:23:49,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:49,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 20:23:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-21 20:23:49,762 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-21 20:23:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:23:50,350 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2023-12-21 20:23:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 20:23:50,358 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 15 [2023-12-21 20:23:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:23:50,359 INFO L225 Difference]: With dead ends: 49 [2023-12-21 20:23:50,359 INFO L226 Difference]: Without dead ends: 38 [2023-12-21 20:23:50,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2023-12-21 20:23:50,360 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 20:23:50,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 36 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 20:23:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-21 20:23:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2023-12-21 20:23:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-21 20:23:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-21 20:23:50,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2023-12-21 20:23:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:23:50,367 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-21 20:23:50,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-21 20:23:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-21 20:23:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 20:23:50,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:23:50,368 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:23:50,375 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-21 20:23:50,568 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-21 20:23:50,569 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:23:50,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:23:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1294961129, now seen corresponding path program 1 times [2023-12-21 20:23:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:23:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87151609] [2023-12-21 20:23:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:23:50,570 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-21 20:23:50,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:23:50,571 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-21 20:23:50,572 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-21 20:23:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:23:50,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 20:23:50,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:23:50,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:23:50,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:23:50,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:23:50,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:23:50,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:23:50,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2023-12-21 20:23:50,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:23:50,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 63 [2023-12-21 20:23:50,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:23:50,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 55 [2023-12-21 20:23:51,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:23:51,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 57 [2023-12-21 20:23:51,167 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-21 20:23:51,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:23:54,683 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-21 20:23:54,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:23:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87151609] [2023-12-21 20:23:54,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87151609] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:23:54,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:23:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-21 20:23:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957468278] [2023-12-21 20:23:54,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:23:54,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 20:23:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:23:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 20:23:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-21 20:23:54,685 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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-21 20:23:59,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:24:02,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:24:17,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:24:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:24:24,093 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2023-12-21 20:24:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 20:24:24,097 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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) Word has length 16 [2023-12-21 20:24:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:24:24,097 INFO L225 Difference]: With dead ends: 64 [2023-12-21 20:24:24,097 INFO L226 Difference]: Without dead ends: 62 [2023-12-21 20:24:24,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=200, Invalid=668, Unknown=2, NotChecked=0, Total=870 [2023-12-21 20:24:24,098 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 90 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:24:24,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 89 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2023-12-21 20:24:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-21 20:24:24,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2023-12-21 20:24:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-21 20:24:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2023-12-21 20:24:24,118 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 16 [2023-12-21 20:24:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:24:24,120 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-12-21 20:24:24,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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-21 20:24:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2023-12-21 20:24:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 20:24:24,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:24:24,121 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:24:24,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-21 20:24:24,326 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-21 20:24:24,327 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:24:24,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:24:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1610649009, now seen corresponding path program 3 times [2023-12-21 20:24:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:24:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597795721] [2023-12-21 20:24:24,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:24:24,329 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-21 20:24:24,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:24:24,329 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-21 20:24:24,347 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-21 20:24:24,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:24:24,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:24:24,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 20:24:24,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:24:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:24:24,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:24:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:24:25,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:24:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597795721] [2023-12-21 20:24:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597795721] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:24:25,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:24:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-21 20:24:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618687436] [2023-12-21 20:24:25,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:24:25,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 20:24:25,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:24:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 20:24:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-12-21 20:24:25,169 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 18 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-21 20:24:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:24:26,754 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2023-12-21 20:24:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 20:24:26,763 INFO L78 Accepts]: Start accepts. Automaton has has 18 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) Word has length 16 [2023-12-21 20:24:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:24:26,763 INFO L225 Difference]: With dead ends: 82 [2023-12-21 20:24:26,763 INFO L226 Difference]: Without dead ends: 54 [2023-12-21 20:24:26,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2023-12-21 20:24:26,764 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 91 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:24:26,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 111 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-21 20:24:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-21 20:24:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2023-12-21 20:24:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-21 20:24:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-12-21 20:24:26,779 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2023-12-21 20:24:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:24:26,779 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-12-21 20:24:26,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 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-21 20:24:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-12-21 20:24:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 20:24:26,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:24:26,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:24:26,785 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-21 20:24:26,987 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-21 20:24:26,988 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:24:26,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:24:26,988 INFO L85 PathProgramCache]: Analyzing trace with hash 774418575, now seen corresponding path program 4 times [2023-12-21 20:24:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:24:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269315294] [2023-12-21 20:24:26,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:24:26,989 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-21 20:24:26,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:24:26,990 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-21 20:24:26,990 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-21 20:24:27,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:24:27,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:24:27,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 20:24:27,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:24:27,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:24:27,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:24:27,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:24:27,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2023-12-21 20:24:27,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:24:27,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2023-12-21 20:24:27,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:24:27,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2023-12-21 20:24:27,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:24:27,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 29 [2023-12-21 20:24:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 20:24:27,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:24:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 20:24:29,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:24:29,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269315294] [2023-12-21 20:24:29,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269315294] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:24:29,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:24:29,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-21 20:24:29,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542565923] [2023-12-21 20:24:29,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:24:29,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 20:24:29,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:24:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 20:24:29,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-21 20:24:29,023 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-21 20:24:34,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:24:38,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:24:44,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:24:51,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:24:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:24:52,968 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2023-12-21 20:24:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 20:24:52,968 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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) Word has length 17 [2023-12-21 20:24:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:24:52,970 INFO L225 Difference]: With dead ends: 100 [2023-12-21 20:24:52,970 INFO L226 Difference]: Without dead ends: 98 [2023-12-21 20:24:52,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=203, Invalid=551, Unknown=2, NotChecked=0, Total=756 [2023-12-21 20:24:52,971 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 90 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-12-21 20:24:52,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 82 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 13.4s Time] [2023-12-21 20:24:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-21 20:24:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 40. [2023-12-21 20:24:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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-21 20:24:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-12-21 20:24:52,991 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 17 [2023-12-21 20:24:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:24:52,992 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-12-21 20:24:52,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-21 20:24:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2023-12-21 20:24:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 20:24:52,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:24:52,992 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:24:52,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-21 20:24:53,198 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-21 20:24:53,198 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:24:53,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:24:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2012757527, now seen corresponding path program 2 times [2023-12-21 20:24:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:24:53,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107588821] [2023-12-21 20:24:53,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:24:53,199 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-21 20:24:53,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:24:53,200 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-21 20:24:53,201 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-21 20:24:53,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:24:53,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:24:53,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 20:24:53,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:24:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 20:24:53,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:24:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:24:54,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:24:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107588821] [2023-12-21 20:24:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107588821] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:24:54,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:24:54,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2023-12-21 20:24:54,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39319919] [2023-12-21 20:24:54,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:24:54,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 20:24:54,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:24:54,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 20:24:54,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2023-12-21 20:24:54,108 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:24:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:24:55,511 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2023-12-21 20:24:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 20:24:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-21 20:24:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:24:55,521 INFO L225 Difference]: With dead ends: 83 [2023-12-21 20:24:55,521 INFO L226 Difference]: Without dead ends: 59 [2023-12-21 20:24:55,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 20:24:55,522 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 113 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:24:55,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 83 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 20:24:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-21 20:24:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 40. [2023-12-21 20:24:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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-21 20:24:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2023-12-21 20:24:55,532 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 18 [2023-12-21 20:24:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:24:55,533 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2023-12-21 20:24:55,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:24:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2023-12-21 20:24:55,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 20:24:55,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:24:55,553 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:24:55,558 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 (11)] Ended with exit code 0 [2023-12-21 20:24:55,758 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-21 20:24:55,759 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:24:55,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:24:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 683920774, now seen corresponding path program 3 times [2023-12-21 20:24:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:24:55,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073575492] [2023-12-21 20:24:55,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:24:55,759 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-21 20:24:55,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:24:55,761 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-21 20:24:55,807 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-21 20:24:56,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:24:56,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:24:56,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:24:56,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:24:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 20:24:56,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:24:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:24:57,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:24:57,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073575492] [2023-12-21 20:24:57,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073575492] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:24:57,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:24:57,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2023-12-21 20:24:57,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486429746] [2023-12-21 20:24:57,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:24:57,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 20:24:57,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:24:57,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 20:24:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-12-21 20:24:57,040 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 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-21 20:24:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:24:59,372 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2023-12-21 20:24:59,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 20:24:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 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 19 [2023-12-21 20:24:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:24:59,374 INFO L225 Difference]: With dead ends: 83 [2023-12-21 20:24:59,374 INFO L226 Difference]: Without dead ends: 70 [2023-12-21 20:24:59,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=437, Invalid=1369, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 20:24:59,374 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 116 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:24:59,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 82 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 20:24:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-21 20:24:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2023-12-21 20:24:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 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-21 20:24:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2023-12-21 20:24:59,387 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 19 [2023-12-21 20:24:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:24:59,387 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-12-21 20:24:59,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 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-21 20:24:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2023-12-21 20:24:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 20:24:59,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:24:59,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:24:59,395 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-21 20:24:59,591 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-21 20:24:59,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:24:59,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:24:59,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1855312905, now seen corresponding path program 4 times [2023-12-21 20:24:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:24:59,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500979444] [2023-12-21 20:24:59,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:24:59,592 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-21 20:24:59,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:24:59,593 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-21 20:24:59,595 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-21 20:24:59,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:24:59,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:24:59,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 20:24:59,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:24:59,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:24:59,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:24:59,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:24:59,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:24:59,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:24:59,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2023-12-21 20:25:00,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:25:00,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 58 [2023-12-21 20:25:00,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:25:00,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 81 [2023-12-21 20:25:00,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:25:00,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 67 [2023-12-21 20:25:00,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:25:00,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 140 treesize of output 84 [2023-12-21 20:25:00,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:25:00,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 61 [2023-12-21 20:25:00,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:25:00,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 65 [2023-12-21 20:25:00,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:25:00,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 57 [2023-12-21 20:25:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:25:00,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:25:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:25:09,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:25:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500979444] [2023-12-21 20:25:09,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500979444] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:25:09,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:25:09,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-21 20:25:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514962944] [2023-12-21 20:25:09,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:25:09,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 20:25:09,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:25:09,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 20:25:09,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:25:09,277 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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-21 20:25:25,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:25:39,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:25:46,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:25:52,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:26:12,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:26:19,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:26:23,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:26:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:26:28,710 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2023-12-21 20:26:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-12-21 20:26:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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 20 [2023-12-21 20:26:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:26:28,711 INFO L225 Difference]: With dead ends: 157 [2023-12-21 20:26:28,711 INFO L226 Difference]: Without dead ends: 155 [2023-12-21 20:26:28,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1762 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=1057, Invalid=4642, Unknown=1, NotChecked=0, Total=5700 [2023-12-21 20:26:28,713 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 242 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 59 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:26:28,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 210 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 428 Invalid, 4 Unknown, 0 Unchecked, 33.6s Time] [2023-12-21 20:26:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-12-21 20:26:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 46. [2023-12-21 20:26:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 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-21 20:26:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2023-12-21 20:26:28,757 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 20 [2023-12-21 20:26:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:26:28,757 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2023-12-21 20:26:28,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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-21 20:26:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2023-12-21 20:26:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 20:26:28,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:26:28,757 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:26:28,767 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-21 20:26:28,967 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-21 20:26:28,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:26:28,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:26:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1124717088, now seen corresponding path program 5 times [2023-12-21 20:26:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:26:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500749296] [2023-12-21 20:26:28,968 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:26:28,968 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-21 20:26:28,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:26:28,969 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-21 20:26:28,970 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-21 20:26:29,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-21 20:26:29,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:26:29,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-21 20:26:29,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:26:29,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:26:29,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:26:29,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:26:29,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:26:29,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:26:29,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2023-12-21 20:26:29,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:26:29,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 65 [2023-12-21 20:26:29,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:26:29,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 67 [2023-12-21 20:26:29,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:26:29,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 215 treesize of output 131 [2023-12-21 20:26:29,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:26:29,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 137 treesize of output 117 [2023-12-21 20:26:30,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:26:30,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 143 [2023-12-21 20:26:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:26:30,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:26:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:26:44,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:26:44,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500749296] [2023-12-21 20:26:44,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500749296] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:26:44,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:26:44,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2023-12-21 20:26:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534499585] [2023-12-21 20:26:44,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:26:44,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-21 20:26:44,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:26:44,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-21 20:26:44,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2023-12-21 20:26:44,400 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-21 20:26:49,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:26:53,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:27:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:27:13,938 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2023-12-21 20:27:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 20:27:13,939 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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 21 [2023-12-21 20:27:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:27:13,940 INFO L225 Difference]: With dead ends: 75 [2023-12-21 20:27:13,940 INFO L226 Difference]: Without dead ends: 73 [2023-12-21 20:27:13,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=329, Invalid=1231, Unknown=0, NotChecked=0, Total=1560 [2023-12-21 20:27:13,940 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 100 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-12-21 20:27:13,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 117 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 277 Invalid, 1 Unknown, 0 Unchecked, 12.4s Time] [2023-12-21 20:27:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-21 20:27:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2023-12-21 20:27:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 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-21 20:27:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2023-12-21 20:27:13,968 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 21 [2023-12-21 20:27:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:27:13,968 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2023-12-21 20:27:13,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-21 20:27:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2023-12-21 20:27:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 20:27:13,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:27:13,969 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:27:13,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-21 20:27:14,176 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-21 20:27:14,177 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:27:14,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:27:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1144979825, now seen corresponding path program 5 times [2023-12-21 20:27:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:27:14,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897738826] [2023-12-21 20:27:14,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:27:14,178 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-21 20:27:14,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:27:14,180 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:27:14,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-21 20:27:14,700 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-21 20:27:14,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:27:14,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 20:27:14,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:27:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:27:14,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:27:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:27:16,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:27:16,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897738826] [2023-12-21 20:27:16,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897738826] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:27:16,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:27:16,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2023-12-21 20:27:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515325709] [2023-12-21 20:27:16,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:27:16,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-21 20:27:16,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:27:16,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-21 20:27:16,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-12-21 20:27:16,182 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-21 20:27:23,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:27:23,292 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2023-12-21 20:27:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-21 20:27:23,302 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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 22 [2023-12-21 20:27:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:27:23,303 INFO L225 Difference]: With dead ends: 173 [2023-12-21 20:27:23,303 INFO L226 Difference]: Without dead ends: 161 [2023-12-21 20:27:23,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1427 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1032, Invalid=3938, Unknown=0, NotChecked=0, Total=4970 [2023-12-21 20:27:23,305 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 341 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:27:23,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 220 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-21 20:27:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-21 20:27:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 58. [2023-12-21 20:27:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 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-21 20:27:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-12-21 20:27:23,341 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 22 [2023-12-21 20:27:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:27:23,341 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-12-21 20:27:23,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-21 20:27:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-12-21 20:27:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 20:27:23,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:27:23,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:27:23,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-21 20:27:23,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:27:23,545 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:27:23,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:27:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 312612751, now seen corresponding path program 6 times [2023-12-21 20:27:23,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:27:23,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477234456] [2023-12-21 20:27:23,547 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:27:23,547 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-21 20:27:23,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:27:23,548 INFO L229 MonitoredProcess]: Starting monitored process 16 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-21 20:27:23,550 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 (16)] Waiting until timeout for monitored process [2023-12-21 20:27:24,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-12-21 20:27:24,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:27:24,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-21 20:27:24,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:27:24,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:27:24,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:27:24,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:27:24,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:27:24,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:27:24,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2023-12-21 20:27:24,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:27:24,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 67 [2023-12-21 20:27:24,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:27:24,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 91 [2023-12-21 20:27:24,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:27:24,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 67 [2023-12-21 20:27:24,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:27:24,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 119 [2023-12-21 20:27:24,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:27:24,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 246 treesize of output 162 [2023-12-21 20:27:24,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:27:24,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 173 treesize of output 145 [2023-12-21 20:27:25,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:27:25,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 143 [2023-12-21 20:27:25,492 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-21 20:27:25,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:27:46,546 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-21 20:27:46,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:27:46,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477234456] [2023-12-21 20:27:46,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477234456] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:27:46,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:27:46,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2023-12-21 20:27:46,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618677068] [2023-12-21 20:27:46,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:27:46,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-21 20:27:46,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:27:46,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-21 20:27:46,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2023-12-21 20:27:46,547 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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-21 20:27:55,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:28:11,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:28:19,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:28:44,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:28:54,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:29:37,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:30:11,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:30:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:30:59,313 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2023-12-21 20:30:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-21 20:30:59,313 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-21 20:30:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:30:59,314 INFO L225 Difference]: With dead ends: 118 [2023-12-21 20:30:59,314 INFO L226 Difference]: Without dead ends: 116 [2023-12-21 20:30:59,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 163.3s TimeCoverageRelationStatistics Valid=767, Invalid=4339, Unknown=6, NotChecked=0, Total=5112 [2023-12-21 20:30:59,315 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 192 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 47 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:30:59,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 182 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 504 Invalid, 3 Unknown, 0 Unchecked, 48.6s Time] [2023-12-21 20:30:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-21 20:30:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 56. [2023-12-21 20:30:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:30:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2023-12-21 20:30:59,370 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 23 [2023-12-21 20:30:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:30:59,370 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2023-12-21 20:30:59,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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-21 20:30:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2023-12-21 20:30:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 20:30:59,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:30:59,371 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:30:59,381 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 (16)] Forceful destruction successful, exit code 0 [2023-12-21 20:30:59,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-21 20:30:59,580 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:30:59,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:30:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1125289167, now seen corresponding path program 6 times [2023-12-21 20:30:59,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:30:59,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725861156] [2023-12-21 20:30:59,580 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:30:59,580 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-21 20:30:59,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:30:59,582 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:30:59,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-21 20:30:59,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-12-21 20:30:59,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:30:59,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-21 20:30:59,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:31:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:31:00,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:31:02,251 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-21 20:31:02,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:31:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725861156] [2023-12-21 20:31:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725861156] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:31:02,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:31:02,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-21 20:31:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457464967] [2023-12-21 20:31:02,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:31:02,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 20:31:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:31:02,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 20:31:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 20:31:02,252 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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-21 20:31:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:31:19,244 INFO L93 Difference]: Finished difference Result 232 states and 255 transitions. [2023-12-21 20:31:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-12-21 20:31:19,255 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-21 20:31:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:31:19,256 INFO L225 Difference]: With dead ends: 232 [2023-12-21 20:31:19,256 INFO L226 Difference]: Without dead ends: 221 [2023-12-21 20:31:19,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3925 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=2370, Invalid=9402, Unknown=0, NotChecked=0, Total=11772 [2023-12-21 20:31:19,259 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 678 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:31:19,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 226 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-21 20:31:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-21 20:31:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 66. [2023-12-21 20:31:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 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-21 20:31:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2023-12-21 20:31:19,342 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 23 [2023-12-21 20:31:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:31:19,342 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2023-12-21 20:31:19,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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-21 20:31:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2023-12-21 20:31:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 20:31:19,343 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:31:19,343 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:31:19,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-21 20:31:19,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:31:19,550 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:31:19,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:31:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1401659130, now seen corresponding path program 7 times [2023-12-21 20:31:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:31:19,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667345871] [2023-12-21 20:31:19,550 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 20:31:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:31:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:31:19,551 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:31:19,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-21 20:31:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:31:19,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 20:31:19,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:31:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:31:20,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:31:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:31:20,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:31:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667345871] [2023-12-21 20:31:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667345871] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:31:20,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:31:20,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-21 20:31:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435052962] [2023-12-21 20:31:20,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:31:20,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 20:31:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:31:20,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 20:31:20,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2023-12-21 20:31:20,907 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:31:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:31:22,339 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2023-12-21 20:31:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 20:31:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-21 20:31:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:31:22,350 INFO L225 Difference]: With dead ends: 103 [2023-12-21 20:31:22,350 INFO L226 Difference]: Without dead ends: 83 [2023-12-21 20:31:22,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2023-12-21 20:31:22,351 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:31:22,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 89 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 20:31:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-21 20:31:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2023-12-21 20:31:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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-21 20:31:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2023-12-21 20:31:22,404 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 24 [2023-12-21 20:31:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:31:22,404 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2023-12-21 20:31:22,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:31:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2023-12-21 20:31:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 20:31:22,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:31:22,404 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:31:22,412 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 (18)] Ended with exit code 0 [2023-12-21 20:31:22,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:31:22,611 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:31:22,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:31:22,611 INFO L85 PathProgramCache]: Analyzing trace with hash 4843991, now seen corresponding path program 8 times [2023-12-21 20:31:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:31:22,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315570135] [2023-12-21 20:31:22,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:31:22,612 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-21 20:31:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:31:22,613 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:31:22,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-21 20:31:23,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:31:23,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:31:23,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 20:31:23,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:31:23,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:31:23,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:31:23,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:31:23,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:31:23,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:23,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2023-12-21 20:31:23,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:23,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 57 [2023-12-21 20:31:23,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:23,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 86 [2023-12-21 20:31:23,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:23,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 45 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 126 treesize of output 119 [2023-12-21 20:31:23,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:23,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 66 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 158 treesize of output 161 [2023-12-21 20:31:24,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:24,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 67 [2023-12-21 20:31:24,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:24,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 55 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 201 treesize of output 125 [2023-12-21 20:31:24,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:24,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 63 [2023-12-21 20:31:24,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:24,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 65 [2023-12-21 20:31:24,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:24,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 65 [2023-12-21 20:31:24,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:24,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 65 [2023-12-21 20:31:25,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:31:25,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 57 [2023-12-21 20:31:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:31:25,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:31:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:31:52,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:31:52,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315570135] [2023-12-21 20:31:52,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315570135] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:31:52,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:31:52,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-12-21 20:31:52,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679368799] [2023-12-21 20:31:52,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:31:52,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 20:31:52,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:31:52,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 20:31:52,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2023-12-21 20:31:52,529 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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-21 20:31:56,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:32:00,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:32:15,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:32:41,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:33:29,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:33:50,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:34:00,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:34:37,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:34:48,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:35:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:35:07,292 INFO L93 Difference]: Finished difference Result 263 states and 290 transitions. [2023-12-21 20:35:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-12-21 20:35:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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-21 20:35:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:35:07,293 INFO L225 Difference]: With dead ends: 263 [2023-12-21 20:35:07,293 INFO L226 Difference]: Without dead ends: 261 [2023-12-21 20:35:07,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 173.2s TimeCoverageRelationStatistics Valid=1896, Invalid=8396, Unknown=10, NotChecked=0, Total=10302 [2023-12-21 20:35:07,295 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 421 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 112 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.5s IncrementalHoareTripleChecker+Time [2023-12-21 20:35:07,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 453 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 830 Invalid, 4 Unknown, 0 Unchecked, 48.5s Time] [2023-12-21 20:35:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-21 20:35:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 76. [2023-12-21 20:35:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 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-21 20:35:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2023-12-21 20:35:07,362 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 24 [2023-12-21 20:35:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:35:07,362 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2023-12-21 20:35:07,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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-21 20:35:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2023-12-21 20:35:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 20:35:07,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:35:07,362 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:35:07,371 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 (19)] Ended with exit code 0 [2023-12-21 20:35:07,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:35:07,571 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:35:07,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:35:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash -464989248, now seen corresponding path program 9 times [2023-12-21 20:35:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:35:07,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810196536] [2023-12-21 20:35:07,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:35:07,572 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-21 20:35:07,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:35:07,573 INFO L229 MonitoredProcess]: Starting monitored process 20 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-21 20:35:07,577 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 (20)] Waiting until timeout for monitored process [2023-12-21 20:35:08,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:35:08,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:35:08,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 20:35:08,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:35:08,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:35:08,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:35:08,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2023-12-21 20:35:08,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:08,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2023-12-21 20:35:08,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:08,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 67 [2023-12-21 20:35:08,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:08,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 105 [2023-12-21 20:35:08,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:08,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 45 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 137 treesize of output 146 [2023-12-21 20:35:09,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:09,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-12-21 20:35:09,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:09,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 240 treesize of output 176 [2023-12-21 20:35:09,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:09,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 101 [2023-12-21 20:35:09,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:09,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 153 treesize of output 125 [2023-12-21 20:35:09,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:09,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 144 treesize of output 128 [2023-12-21 20:35:10,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:10,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 150 treesize of output 98 [2023-12-21 20:35:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:35:10,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:35:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:35:43,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:35:43,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810196536] [2023-12-21 20:35:43,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810196536] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:35:43,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:35:43,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-12-21 20:35:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498821038] [2023-12-21 20:35:43,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:35:43,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 20:35:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:35:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 20:35:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=977, Unknown=1, NotChecked=0, Total=1122 [2023-12-21 20:35:43,074 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 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-21 20:36:04,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:05,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:09,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:13,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:17,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:21,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:25,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:27,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:35,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:38,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:40,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:36:44,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:37:29,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:37:59,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:38:03,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:38:04,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-21 20:38:05,970 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 20:38:05,986 WARN L340 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 (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 20:38:06,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-21 20:38:06,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 104.7s TimeCoverageRelationStatistics Valid=419, Invalid=2768, Unknown=5, NotChecked=0, Total=3192 [2023-12-21 20:38:06,076 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 65 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 36 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:38:06,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 78 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 496 Invalid, 6 Unknown, 0 Unchecked, 68.9s Time] [2023-12-21 20:38:06,077 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 20:38:06,087 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 (20)] Ended with exit code 0 [2023-12-21 20:38:06,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-21 20:38:06,278 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (76states) and FLOYD_HOARE automaton (currently 40 states, 34 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 57 known predicates. [2023-12-21 20:38:06,283 INFO L445 BasicCegarLoop]: Path program histogram: [9, 6, 1, 1, 1, 1] [2023-12-21 20:38:06,285 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 20:38:06,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:38:06 BoogieIcfgContainer [2023-12-21 20:38:06,286 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 20:38:06,286 INFO L158 Benchmark]: Toolchain (without parser) took 884764.90ms. Allocated memory is still 268.4MB. Free memory was 216.0MB in the beginning and 110.2MB in the end (delta: 105.8MB). Peak memory consumption was 105.7MB. Max. memory is 8.0GB. [2023-12-21 20:38:06,287 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 219.2MB. Free memory was 168.8MB in the beginning and 168.7MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 20:38:06,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.21ms. Allocated memory is still 268.4MB. Free memory was 215.7MB in the beginning and 203.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 20:38:06,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.72ms. Allocated memory is still 268.4MB. Free memory was 203.7MB in the beginning and 202.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 20:38:06,287 INFO L158 Benchmark]: Boogie Preprocessor took 57.48ms. Allocated memory is still 268.4MB. Free memory was 202.0MB in the beginning and 199.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 20:38:06,287 INFO L158 Benchmark]: RCFGBuilder took 321.55ms. Allocated memory is still 268.4MB. Free memory was 199.6MB in the beginning and 182.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 20:38:06,287 INFO L158 Benchmark]: TraceAbstraction took 884158.84ms. Allocated memory is still 268.4MB. Free memory was 182.1MB in the beginning and 110.2MB in the end (delta: 72.0MB). Peak memory consumption was 72.1MB. Max. memory is 8.0GB. [2023-12-21 20:38:06,288 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 219.2MB. Free memory was 168.8MB in the beginning and 168.7MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.21ms. Allocated memory is still 268.4MB. Free memory was 215.7MB in the beginning and 203.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.72ms. Allocated memory is still 268.4MB. Free memory was 203.7MB in the beginning and 202.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.48ms. Allocated memory is still 268.4MB. Free memory was 202.0MB in the beginning and 199.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 321.55ms. Allocated memory is still 268.4MB. Free memory was 199.6MB in the beginning and 182.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 884158.84ms. Allocated memory is still 268.4MB. Free memory was 182.1MB in the beginning and 110.2MB in the end (delta: 72.0MB). Peak memory consumption was 72.1MB. 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 - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was constructing difference of abstraction (76states) and FLOYD_HOARE automaton (currently 40 states, 34 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 57 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.1s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 747.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 2761 SdHoareTripleChecker+Valid, 262.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2761 mSDsluCounter, 2198 SdHoareTripleChecker+Invalid, 256.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1947 mSDsCounter, 993 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5348 IncrementalHoareTripleChecker+Invalid, 6363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 993 mSolverCounterUnsat, 251 mSDtfsCounter, 5348 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1041 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 747 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13887 ImplicationChecksByTransitivity, 593.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=18, InterpolantAutomatonStates: 572, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 856 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 126.5s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 619 ConstructedInterpolants, 39 QuantifiedInterpolants, 39642 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1694 ConjunctsInSsa, 417 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 76/527 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown