/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-cav19/array_init_var_plus_ind3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:10:12,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:10:12,364 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-16 07:10:12,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:10:12,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:10:12,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:10:12,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:10:12,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:10:12,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:10:12,398 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:10:12,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:10:12,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:10:12,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:10:12,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:10:12,400 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:10:12,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:10:12,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:10:12,401 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:10:12,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:10:12,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:10:12,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:10:12,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:10:12,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:10:12,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:10:12,402 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:10:12,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:10:12,402 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:10:12,402 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:10:12,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:10:12,403 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:10:12,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:10:12,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:10:12,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:10:12,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:10:12,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:10:12,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:10:12,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:10:12,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:10:12,404 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:10:12,404 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:10:12,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:10:12,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:10:12,405 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:10:12,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:10:12,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:10:12,405 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:10:12,405 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-16 07:10:12,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:10:12,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:10:12,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:10:12,608 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:10:12,612 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:10:12,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-cav19/array_init_var_plus_ind3.c [2023-12-16 07:10:13,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:10:13,693 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:10:13,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-cav19/array_init_var_plus_ind3.c [2023-12-16 07:10:13,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c78202ef/5adf3032f37340acb465dba14ae12d8b/FLAG41fb86e65 [2023-12-16 07:10:13,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c78202ef/5adf3032f37340acb465dba14ae12d8b [2023-12-16 07:10:13,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:10:13,713 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:10:13,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:10:13,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:10:13,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:10:13,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1a60f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13, skipping insertion in model container [2023-12-16 07:10:13,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,734 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:10:13,832 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-cav19/array_init_var_plus_ind3.c[415,428] [2023-12-16 07:10:13,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:10:13,858 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:10:13,873 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-cav19/array_init_var_plus_ind3.c[415,428] [2023-12-16 07:10:13,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:10:13,890 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:10:13,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13 WrapperNode [2023-12-16 07:10:13,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:10:13,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:10:13,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:10:13,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:10:13,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,912 INFO L138 Inliner]: procedures = 17, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2023-12-16 07:10:13,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:10:13,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:10:13,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:10:13,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:10:13,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,928 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2023-12-16 07:10:13,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:10:13,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:10:13,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:10:13,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:10:13,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (1/1) ... [2023-12-16 07:10:13,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:10:13,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:10:13,959 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-16 07:10:13,974 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-16 07:10:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:10:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:10:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 07:10:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 07:10:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 07:10:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 07:10:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:10:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:10:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 07:10:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 07:10:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 07:10:14,059 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:10:14,061 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:10:14,210 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:10:14,232 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:10:14,232 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 07:10:14,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:10:14 BoogieIcfgContainer [2023-12-16 07:10:14,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:10:14,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:10:14,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:10:14,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:10:14,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:10:13" (1/3) ... [2023-12-16 07:10:14,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc8833a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:10:14, skipping insertion in model container [2023-12-16 07:10:14,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:10:13" (2/3) ... [2023-12-16 07:10:14,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc8833a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:10:14, skipping insertion in model container [2023-12-16 07:10:14,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:10:14" (3/3) ... [2023-12-16 07:10:14,238 INFO L112 eAbstractionObserver]: Analyzing ICFG array_init_var_plus_ind3.c [2023-12-16 07:10:14,252 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:10:14,252 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 07:10:14,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:10:14,297 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;@2c3ba44b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:10:14,298 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 07:10:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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-16 07:10:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 07:10:14,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:14,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 07:10:14,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:14,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1929175509, now seen corresponding path program 1 times [2023-12-16 07:10:14,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:14,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521895276] [2023-12-16 07:10:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:10:14,318 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-16 07:10:14,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:14,321 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-16 07:10:14,327 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-16 07:10:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:10:14,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 07:10:14,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:14,383 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-16 07:10:14,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:10:14,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521895276] [2023-12-16 07:10:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521895276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:10:14,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:10:14,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:10:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554400401] [2023-12-16 07:10:14,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:10:14,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 07:10:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:14,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 07:10:14,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:10:14,407 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 07:10:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:14,467 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2023-12-16 07:10:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 07:10:14,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-16 07:10:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:14,474 INFO L225 Difference]: With dead ends: 19 [2023-12-16 07:10:14,474 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 07:10:14,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-16 07:10:14,482 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:14,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:10:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 07:10:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-16 07:10:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-16 07:10:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2023-12-16 07:10:14,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2023-12-16 07:10:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:14,506 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-12-16 07:10:14,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 07:10:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2023-12-16 07:10:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 07:10:14,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:14,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 07:10:14,511 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-16 07:10:14,713 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-16 07:10:14,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:14,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1939334240, now seen corresponding path program 1 times [2023-12-16 07:10:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178164233] [2023-12-16 07:10:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:10:14,715 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-16 07:10:14,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:14,717 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-16 07:10:14,720 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-16 07:10:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:10:14,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 07:10:14,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:14,768 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-16 07:10:14,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:10:14,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178164233] [2023-12-16 07:10:14,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178164233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:10:14,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:10:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:10:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868780493] [2023-12-16 07:10:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:10:14,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:10:14,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:14,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:10:14,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:10:14,771 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 07:10:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:14,789 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-12-16 07:10:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:10:14,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-16 07:10:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:14,790 INFO L225 Difference]: With dead ends: 23 [2023-12-16 07:10:14,790 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 07:10:14,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:10:14,791 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:14,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:10:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 07:10:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 10. [2023-12-16 07:10:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-16 07:10:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-12-16 07:10:14,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2023-12-16 07:10:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:14,800 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-12-16 07:10:14,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 07:10:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-12-16 07:10:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 07:10:14,801 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:14,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:14,805 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-16 07:10:15,005 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-16 07:10:15,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:15,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash 59809599, now seen corresponding path program 1 times [2023-12-16 07:10:15,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329782365] [2023-12-16 07:10:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:10:15,014 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-16 07:10:15,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:15,016 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-16 07:10:15,016 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-16 07:10:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:10:15,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 07:10:15,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:15,078 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-16 07:10:15,079 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:10:15,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:15,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329782365] [2023-12-16 07:10:15,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329782365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:10:15,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:10:15,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:10:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943608000] [2023-12-16 07:10:15,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:10:15,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:10:15,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:15,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:10:15,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:10:15,080 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:10:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:15,100 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2023-12-16 07:10:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:10:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 07:10:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:15,100 INFO L225 Difference]: With dead ends: 18 [2023-12-16 07:10:15,100 INFO L226 Difference]: Without dead ends: 11 [2023-12-16 07:10:15,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:10:15,101 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:15,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:10:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-16 07:10:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-16 07:10:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-16 07:10:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-16 07:10:15,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2023-12-16 07:10:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:15,104 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-16 07:10:15,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:10:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-16 07:10:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 07:10:15,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:15,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:15,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 07:10:15,307 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-16 07:10:15,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:15,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1422467303, now seen corresponding path program 1 times [2023-12-16 07:10:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:15,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627616312] [2023-12-16 07:10:15,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:10:15,309 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-16 07:10:15,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:15,310 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-16 07:10:15,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 07:10:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:10:15,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:10:15,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:15,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:15,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:15,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627616312] [2023-12-16 07:10:15,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627616312] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:15,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:15,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 07:10:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722538425] [2023-12-16 07:10:15,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:15,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 07:10:15,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:15,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 07:10:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:10:15,424 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-16 07:10:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:15,495 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-12-16 07:10:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:10:15,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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 8 [2023-12-16 07:10:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:15,496 INFO L225 Difference]: With dead ends: 40 [2023-12-16 07:10:15,496 INFO L226 Difference]: Without dead ends: 34 [2023-12-16 07:10:15,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:10:15,497 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:15,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 25 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:10:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-16 07:10:15,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 16. [2023-12-16 07:10:15,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-16 07:10:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-16 07:10:15,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 8 [2023-12-16 07:10:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:15,500 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-16 07:10:15,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-16 07:10:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-16 07:10:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 07:10:15,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:15,500 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:15,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 07:10:15,701 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-16 07:10:15,701 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:15,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1097184538, now seen corresponding path program 1 times [2023-12-16 07:10:15,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:15,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278874966] [2023-12-16 07:10:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:10:15,702 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-16 07:10:15,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:15,703 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-16 07:10:15,706 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-16 07:10:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:10:15,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:10:15,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:15,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:15,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278874966] [2023-12-16 07:10:15,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278874966] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:15,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:15,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 07:10:15,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160244237] [2023-12-16 07:10:15,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:15,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 07:10:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 07:10:15,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-16 07:10:15,792 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-16 07:10:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:15,879 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-16 07:10:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 07:10:15,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 9 [2023-12-16 07:10:15,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:15,880 INFO L225 Difference]: With dead ends: 28 [2023-12-16 07:10:15,880 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 07:10:15,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-16 07:10:15,881 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:15,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 29 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:10:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 07:10:15,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-16 07:10:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-16 07:10:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-12-16 07:10:15,884 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 9 [2023-12-16 07:10:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:15,884 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-12-16 07:10:15,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-16 07:10:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-12-16 07:10:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 07:10:15,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:15,884 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:15,901 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-16 07:10:16,086 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-16 07:10:16,087 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:16,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash -939291644, now seen corresponding path program 2 times [2023-12-16 07:10:16,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:16,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964612250] [2023-12-16 07:10:16,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:10:16,088 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-16 07:10:16,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:16,089 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-16 07:10:16,092 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-16 07:10:16,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:10:16,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:16,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:10:16,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:16,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:16,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:16,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964612250] [2023-12-16 07:10:16,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964612250] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:16,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:16,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2023-12-16 07:10:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868512647] [2023-12-16 07:10:16,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:16,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 07:10:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 07:10:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-16 07:10:16,409 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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-16 07:10:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:17,186 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2023-12-16 07:10:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 07:10:17,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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 14 [2023-12-16 07:10:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:17,187 INFO L225 Difference]: With dead ends: 76 [2023-12-16 07:10:17,187 INFO L226 Difference]: Without dead ends: 58 [2023-12-16 07:10:17,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=502, Unknown=0, NotChecked=0, Total=756 [2023-12-16 07:10:17,188 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 138 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:17,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 51 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:10:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-16 07:10:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 28. [2023-12-16 07:10:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 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-16 07:10:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-16 07:10:17,193 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 14 [2023-12-16 07:10:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:17,193 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-16 07:10:17,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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-16 07:10:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-16 07:10:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 07:10:17,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:17,193 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:17,205 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-16 07:10:17,396 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-16 07:10:17,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:17,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1278627842, now seen corresponding path program 2 times [2023-12-16 07:10:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:17,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315811777] [2023-12-16 07:10:17,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:10:17,397 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-16 07:10:17,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:17,398 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-16 07:10:17,399 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-16 07:10:17,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:10:17,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:17,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 07:10:17,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:17,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:17,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:17,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-16 07:10:17,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-16 07:10:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:18,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315811777] [2023-12-16 07:10:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315811777] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:18,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:18,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-16 07:10:18,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247637535] [2023-12-16 07:10:18,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:18,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 07:10:18,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:18,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 07:10:18,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-12-16 07:10:18,010 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 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-16 07:10:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:18,253 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-12-16 07:10:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 07:10:18,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 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-16 07:10:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:18,255 INFO L225 Difference]: With dead ends: 39 [2023-12-16 07:10:18,255 INFO L226 Difference]: Without dead ends: 37 [2023-12-16 07:10:18,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2023-12-16 07:10:18,256 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:18,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:10:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-16 07:10:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2023-12-16 07:10:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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-16 07:10:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-16 07:10:18,261 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2023-12-16 07:10:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:18,261 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-16 07:10:18,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 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-16 07:10:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-16 07:10:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 07:10:18,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:18,262 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:18,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 07:10:18,462 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-16 07:10:18,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:18,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1956042473, now seen corresponding path program 3 times [2023-12-16 07:10:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009912529] [2023-12-16 07:10:18,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:10:18,464 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-16 07:10:18,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:18,465 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-16 07:10:18,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 07:10:18,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-12-16 07:10:18,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:18,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 07:10:18,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:18,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:18,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:18,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:18,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-16 07:10:18,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2023-12-16 07:10:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:19,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:19,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009912529] [2023-12-16 07:10:19,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009912529] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:19,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:19,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-12-16 07:10:19,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301415499] [2023-12-16 07:10:19,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:19,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 07:10:19,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:19,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 07:10:19,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2023-12-16 07:10:19,115 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 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-16 07:10:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:19,783 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-12-16 07:10:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 07:10:19,783 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 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-16 07:10:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:19,784 INFO L225 Difference]: With dead ends: 57 [2023-12-16 07:10:19,784 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 07:10:19,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2023-12-16 07:10:19,785 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 69 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:19,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 72 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 07:10:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 07:10:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2023-12-16 07:10:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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-16 07:10:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-16 07:10:19,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 19 [2023-12-16 07:10:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:19,790 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-16 07:10:19,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 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-16 07:10:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-16 07:10:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 07:10:19,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:19,791 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:19,798 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-16 07:10:19,993 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-16 07:10:19,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:19,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -457694673, now seen corresponding path program 1 times [2023-12-16 07:10:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033463280] [2023-12-16 07:10:19,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:10:19,995 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-16 07:10:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:19,995 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-16 07:10:19,996 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-16 07:10:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:10:20,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:10:20,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:20,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:20,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:20,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033463280] [2023-12-16 07:10:20,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033463280] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:20,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:20,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-16 07:10:20,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329835780] [2023-12-16 07:10:20,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:20,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 07:10:20,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:20,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 07:10:20,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-12-16 07:10:20,236 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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-16 07:10:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:20,333 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-12-16 07:10:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 07:10:20,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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 20 [2023-12-16 07:10:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:20,334 INFO L225 Difference]: With dead ends: 41 [2023-12-16 07:10:20,334 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 07:10:20,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-12-16 07:10:20,335 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:20,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:10:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 07:10:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-16 07:10:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 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-16 07:10:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-12-16 07:10:20,340 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 20 [2023-12-16 07:10:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:20,340 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-12-16 07:10:20,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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-16 07:10:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-12-16 07:10:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 07:10:20,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:20,340 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:20,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 07:10:20,543 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-16 07:10:20,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:20,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:20,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1649746456, now seen corresponding path program 2 times [2023-12-16 07:10:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:20,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635112411] [2023-12-16 07:10:20,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:10:20,544 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-16 07:10:20,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:20,545 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-16 07:10:20,545 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-16 07:10:20,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:10:20,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:20,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 07:10:20,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:20,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:20,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:20,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-16 07:10:20,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-16 07:10:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:21,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635112411] [2023-12-16 07:10:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635112411] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:21,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:21,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-12-16 07:10:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418366117] [2023-12-16 07:10:21,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:21,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 07:10:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:21,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 07:10:21,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2023-12-16 07:10:21,346 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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-16 07:10:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:21,711 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2023-12-16 07:10:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 07:10:21,711 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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 22 [2023-12-16 07:10:21,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:21,712 INFO L225 Difference]: With dead ends: 45 [2023-12-16 07:10:21,712 INFO L226 Difference]: Without dead ends: 43 [2023-12-16 07:10:21,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2023-12-16 07:10:21,712 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:21,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 96 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 07:10:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-16 07:10:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2023-12-16 07:10:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-16 07:10:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-12-16 07:10:21,717 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 22 [2023-12-16 07:10:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:21,717 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-12-16 07:10:21,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 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-16 07:10:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-12-16 07:10:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 07:10:21,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:21,717 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:21,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 07:10:21,920 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-16 07:10:21,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:21,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1817574263, now seen corresponding path program 4 times [2023-12-16 07:10:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:21,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009594924] [2023-12-16 07:10:21,921 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 07:10:21,921 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-16 07:10:21,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:21,922 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-16 07:10:21,923 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-16 07:10:21,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 07:10:21,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:21,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-16 07:10:21,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:22,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:22,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:22,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:22,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:22,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:22,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-12-16 07:10:22,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17650 treesize of output 17394 [2023-12-16 07:10:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:22,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:22,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009594924] [2023-12-16 07:10:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009594924] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:22,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:22,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-16 07:10:22,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533035033] [2023-12-16 07:10:22,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:22,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 07:10:22,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:22,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 07:10:22,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-16 07:10:22,751 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:10:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:23,719 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2023-12-16 07:10:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-16 07:10:23,719 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-16 07:10:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:23,720 INFO L225 Difference]: With dead ends: 91 [2023-12-16 07:10:23,720 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 07:10:23,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=363, Invalid=1529, Unknown=0, NotChecked=0, Total=1892 [2023-12-16 07:10:23,721 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 181 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:23,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 126 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 07:10:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 07:10:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 40. [2023-12-16 07:10:23,726 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-16 07:10:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2023-12-16 07:10:23,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 23 [2023-12-16 07:10:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:23,727 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2023-12-16 07:10:23,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:10:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2023-12-16 07:10:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 07:10:23,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:23,727 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:23,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 07:10:23,928 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-16 07:10:23,928 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:23,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash -455241887, now seen corresponding path program 3 times [2023-12-16 07:10:23,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:23,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057725634] [2023-12-16 07:10:23,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:10:23,929 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-16 07:10:23,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:23,931 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-16 07:10:23,957 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-16 07:10:24,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-16 07:10:24,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:24,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 07:10:24,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:24,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:24,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:24,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:24,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-16 07:10:24,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-12-16 07:10:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:24,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057725634] [2023-12-16 07:10:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057725634] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:24,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:24,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-16 07:10:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82046633] [2023-12-16 07:10:24,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:24,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 07:10:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:24,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 07:10:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2023-12-16 07:10:24,782 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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-16 07:10:26,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-16 07:10:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:27,192 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2023-12-16 07:10:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-16 07:10:27,192 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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) Word has length 24 [2023-12-16 07:10:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:27,192 INFO L225 Difference]: With dead ends: 74 [2023-12-16 07:10:27,192 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 07:10:27,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 07:10:27,193 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 66 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:27,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 87 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-16 07:10:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 07:10:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2023-12-16 07:10:27,198 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-16 07:10:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2023-12-16 07:10:27,198 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 24 [2023-12-16 07:10:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:27,198 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2023-12-16 07:10:27,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 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-16 07:10:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2023-12-16 07:10:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 07:10:27,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:27,199 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 3, 2, 2, 1, 1, 1, 1, 1] [2023-12-16 07:10:27,202 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-16 07:10:27,402 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-16 07:10:27,402 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:27,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash -280690039, now seen corresponding path program 4 times [2023-12-16 07:10:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118846672] [2023-12-16 07:10:27,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 07:10:27,403 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-16 07:10:27,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:27,404 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-16 07:10:27,404 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-16 07:10:27,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 07:10:27,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:27,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 07:10:27,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:27,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:27,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:27,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118846672] [2023-12-16 07:10:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118846672] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:27,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:27,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-12-16 07:10:27,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599134690] [2023-12-16 07:10:27,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:27,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 07:10:27,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:27,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 07:10:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-12-16 07:10:27,727 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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-16 07:10:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:27,880 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2023-12-16 07:10:27,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 07:10:27,880 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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) Word has length 25 [2023-12-16 07:10:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:27,881 INFO L225 Difference]: With dead ends: 53 [2023-12-16 07:10:27,881 INFO L226 Difference]: Without dead ends: 40 [2023-12-16 07:10:27,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-12-16 07:10:27,882 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:27,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:10:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-16 07:10:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-16 07:10:27,886 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-16 07:10:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-12-16 07:10:27,886 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 25 [2023-12-16 07:10:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:27,886 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-12-16 07:10:27,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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-16 07:10:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2023-12-16 07:10:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 07:10:27,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:27,887 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 3, 2, 2, 1, 1, 1, 1, 1] [2023-12-16 07:10:27,892 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-16 07:10:28,094 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-16 07:10:28,095 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:28,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:28,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1400877680, now seen corresponding path program 5 times [2023-12-16 07:10:28,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:28,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268654531] [2023-12-16 07:10:28,096 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 07:10:28,096 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-16 07:10:28,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:28,105 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-16 07:10:28,105 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-16 07:10:28,178 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-12-16 07:10:28,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:28,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 07:10:28,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:28,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:28,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:28,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-16 07:10:28,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-16 07:10:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:29,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:29,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268654531] [2023-12-16 07:10:29,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268654531] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:29,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:29,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-16 07:10:29,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201470128] [2023-12-16 07:10:29,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:29,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 07:10:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:29,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 07:10:29,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2023-12-16 07:10:29,089 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:10:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:29,606 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2023-12-16 07:10:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 07:10:29,606 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-16 07:10:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:29,606 INFO L225 Difference]: With dead ends: 57 [2023-12-16 07:10:29,606 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 07:10:29,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2023-12-16 07:10:29,610 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:29,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 142 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 07:10:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 07:10:29,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2023-12-16 07:10:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:10:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2023-12-16 07:10:29,619 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 27 [2023-12-16 07:10:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:29,619 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2023-12-16 07:10:29,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:10:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2023-12-16 07:10:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 07:10:29,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:29,620 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:29,627 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 (15)] Ended with exit code 0 [2023-12-16 07:10:29,827 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-16 07:10:29,828 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:29,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1296372627, now seen corresponding path program 6 times [2023-12-16 07:10:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:29,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168600095] [2023-12-16 07:10:29,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 07:10:29,828 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-16 07:10:29,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:29,829 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-16 07:10:29,830 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-16 07:10:29,928 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2023-12-16 07:10:29,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:29,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 07:10:29,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:30,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:30,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:30,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:30,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:30,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:30,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-12-16 07:10:30,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4402 treesize of output 4338 [2023-12-16 07:10:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:30,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:30,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168600095] [2023-12-16 07:10:30,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168600095] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:30,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:30,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-16 07:10:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668382383] [2023-12-16 07:10:30,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:30,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 07:10:30,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:30,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 07:10:30,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2023-12-16 07:10:30,884 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 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-16 07:10:35,499 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-16 07:10:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:36,548 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2023-12-16 07:10:36,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-16 07:10:36,548 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 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 28 [2023-12-16 07:10:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:36,549 INFO L225 Difference]: With dead ends: 113 [2023-12-16 07:10:36,549 INFO L226 Difference]: Without dead ends: 111 [2023-12-16 07:10:36,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=556, Invalid=2866, Unknown=0, NotChecked=0, Total=3422 [2023-12-16 07:10:36,550 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 178 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:36,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 210 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 496 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2023-12-16 07:10:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-16 07:10:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 48. [2023-12-16 07:10:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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-16 07:10:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2023-12-16 07:10:36,556 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 28 [2023-12-16 07:10:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:36,557 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2023-12-16 07:10:36,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 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-16 07:10:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2023-12-16 07:10:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 07:10:36,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:36,557 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 3, 2, 2, 1, 1, 1, 1, 1] [2023-12-16 07:10:36,562 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-16 07:10:36,760 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-16 07:10:36,760 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:36,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1815214953, now seen corresponding path program 7 times [2023-12-16 07:10:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:36,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774613033] [2023-12-16 07:10:36,761 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-16 07:10:36,761 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-16 07:10:36,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:36,762 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-16 07:10:36,780 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-16 07:10:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:10:36,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-16 07:10:36,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:36,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:36,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:37,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:37,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-16 07:10:37,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2023-12-16 07:10:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:37,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774613033] [2023-12-16 07:10:37,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774613033] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:37,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:37,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-16 07:10:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572757573] [2023-12-16 07:10:37,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:37,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 07:10:37,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:37,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 07:10:37,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2023-12-16 07:10:37,815 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:10:39,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:39,054 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2023-12-16 07:10:39,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-16 07:10:39,055 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-16 07:10:39,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:39,055 INFO L225 Difference]: With dead ends: 91 [2023-12-16 07:10:39,055 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 07:10:39,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=275, Invalid=1887, Unknown=0, NotChecked=0, Total=2162 [2023-12-16 07:10:39,056 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:39,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 154 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 07:10:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 07:10:39,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2023-12-16 07:10:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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-16 07:10:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2023-12-16 07:10:39,063 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 29 [2023-12-16 07:10:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:39,063 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2023-12-16 07:10:39,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:10:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2023-12-16 07:10:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 07:10:39,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:39,063 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:39,069 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-16 07:10:39,263 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-16 07:10:39,264 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:39,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1929346868, now seen corresponding path program 3 times [2023-12-16 07:10:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41415451] [2023-12-16 07:10:39,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:10:39,265 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-16 07:10:39,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:39,265 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-16 07:10:39,269 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-16 07:10:39,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2023-12-16 07:10:39,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:39,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 07:10:39,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:39,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:40,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:40,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41415451] [2023-12-16 07:10:40,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41415451] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:40,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:40,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2023-12-16 07:10:40,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799508201] [2023-12-16 07:10:40,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:40,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-16 07:10:40,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:40,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-16 07:10:40,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2023-12-16 07:10:40,190 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 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-16 07:10:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:47,076 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2023-12-16 07:10:47,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-16 07:10:47,076 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 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 30 [2023-12-16 07:10:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:47,077 INFO L225 Difference]: With dead ends: 253 [2023-12-16 07:10:47,077 INFO L226 Difference]: Without dead ends: 213 [2023-12-16 07:10:47,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1275, Invalid=3147, Unknown=0, NotChecked=0, Total=4422 [2023-12-16 07:10:47,079 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1144 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:47,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 522 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 07:10:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-16 07:10:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 73. [2023-12-16 07:10:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 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-16 07:10:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2023-12-16 07:10:47,088 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 30 [2023-12-16 07:10:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:47,088 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2023-12-16 07:10:47,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 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-16 07:10:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2023-12-16 07:10:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 07:10:47,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:47,089 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 4, 3, 3, 1, 1, 1, 1, 1] [2023-12-16 07:10:47,092 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 (18)] Forceful destruction successful, exit code 0 [2023-12-16 07:10:47,292 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-16 07:10:47,292 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:47,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash -645037823, now seen corresponding path program 8 times [2023-12-16 07:10:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:47,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166120063] [2023-12-16 07:10:47,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:10:47,293 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-16 07:10:47,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:47,294 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-16 07:10:47,295 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-16 07:10:47,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:10:47,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:47,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 07:10:47,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 3 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:47,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 3 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:47,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166120063] [2023-12-16 07:10:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166120063] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:47,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-16 07:10:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209194473] [2023-12-16 07:10:47,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:47,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 07:10:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 07:10:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2023-12-16 07:10:47,786 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 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-16 07:10:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:48,016 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2023-12-16 07:10:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 07:10:48,017 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 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 30 [2023-12-16 07:10:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:48,017 INFO L225 Difference]: With dead ends: 89 [2023-12-16 07:10:48,017 INFO L226 Difference]: Without dead ends: 73 [2023-12-16 07:10:48,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2023-12-16 07:10:48,018 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:48,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:10:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-16 07:10:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-16 07:10:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 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-16 07:10:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2023-12-16 07:10:48,027 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 30 [2023-12-16 07:10:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:48,027 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2023-12-16 07:10:48,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 25 states have internal predecessors, (58), 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-16 07:10:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2023-12-16 07:10:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 07:10:48,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:48,028 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2023-12-16 07:10:48,035 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 (19)] Forceful destruction successful, exit code 0 [2023-12-16 07:10:48,230 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-16 07:10:48,231 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:48,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash 369418131, now seen corresponding path program 5 times [2023-12-16 07:10:48,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910449714] [2023-12-16 07:10:48,231 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 07:10:48,231 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-16 07:10:48,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:48,232 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-16 07:10:48,236 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-16 07:10:48,378 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2023-12-16 07:10:48,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:48,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-16 07:10:48,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:48,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:48,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:48,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:48,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:48,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:48,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:48,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:48,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:10:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:48,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:50,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2023-12-16 07:10:50,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158175591694 treesize of output 158041373966 [2023-12-16 07:10:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:54,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:54,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910449714] [2023-12-16 07:10:54,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910449714] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:54,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:54,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-12-16 07:10:54,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931267511] [2023-12-16 07:10:54,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:54,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-16 07:10:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:54,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-16 07:10:54,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2023-12-16 07:10:54,138 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 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-16 07:10:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:10:58,272 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2023-12-16 07:10:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-16 07:10:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 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 31 [2023-12-16 07:10:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:10:58,273 INFO L225 Difference]: With dead ends: 186 [2023-12-16 07:10:58,273 INFO L226 Difference]: Without dead ends: 184 [2023-12-16 07:10:58,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1159, Invalid=4243, Unknown=0, NotChecked=0, Total=5402 [2023-12-16 07:10:58,275 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 316 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 07:10:58,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 308 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 07:10:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-16 07:10:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 71. [2023-12-16 07:10:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 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-16 07:10:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2023-12-16 07:10:58,285 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 31 [2023-12-16 07:10:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:10:58,285 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2023-12-16 07:10:58,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 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-16 07:10:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2023-12-16 07:10:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 07:10:58,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:10:58,286 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 4, 3, 3, 1, 1, 1, 1, 1] [2023-12-16 07:10:58,289 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 (20)] Forceful destruction successful, exit code 0 [2023-12-16 07:10:58,489 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-16 07:10:58,489 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:10:58,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:10:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash 869771642, now seen corresponding path program 9 times [2023-12-16 07:10:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:10:58,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956167976] [2023-12-16 07:10:58,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:10:58,490 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-16 07:10:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:10:58,491 INFO L229 MonitoredProcess]: Starting monitored process 21 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-16 07:10:58,495 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 (21)] Waiting until timeout for monitored process [2023-12-16 07:10:58,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-12-16 07:10:58,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:10:58,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-16 07:10:58,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:10:58,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:10:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:58,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:10:59,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-16 07:10:59,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-16 07:10:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:10:59,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:10:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956167976] [2023-12-16 07:10:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956167976] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:10:59,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:10:59,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-16 07:10:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665325158] [2023-12-16 07:10:59,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:10:59,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-16 07:10:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:10:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-16 07:10:59,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2023-12-16 07:10:59,815 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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-16 07:11:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:00,596 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2023-12-16 07:11:00,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 07:11:00,597 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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 32 [2023-12-16 07:11:00,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:00,597 INFO L225 Difference]: With dead ends: 91 [2023-12-16 07:11:00,597 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 07:11:00,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 07:11:00,598 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:00,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 185 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 07:11:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 07:11:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2023-12-16 07:11:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 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-16 07:11:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2023-12-16 07:11:00,609 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 32 [2023-12-16 07:11:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:00,609 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2023-12-16 07:11:00,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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-16 07:11:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2023-12-16 07:11:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 07:11:00,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:00,610 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-12-16 07:11:00,613 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 (21)] Forceful destruction successful, exit code 0 [2023-12-16 07:11:00,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 07:11:00,813 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:00,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash -389328987, now seen corresponding path program 10 times [2023-12-16 07:11:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468547109] [2023-12-16 07:11:00,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 07:11:00,814 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-16 07:11:00,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:00,815 INFO L229 MonitoredProcess]: Starting monitored process 22 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-16 07:11:00,815 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 (22)] Waiting until timeout for monitored process [2023-12-16 07:11:00,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 07:11:00,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:11:00,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-16 07:11:00,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:01,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:11:01,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:01,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:01,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:01,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:11:01,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-12-16 07:11:01,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 538 treesize of output 530 [2023-12-16 07:11:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:02,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:02,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468547109] [2023-12-16 07:11:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468547109] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:11:02,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:11:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-12-16 07:11:02,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292047777] [2023-12-16 07:11:02,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:11:02,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-16 07:11:02,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:02,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-16 07:11:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2023-12-16 07:11:02,222 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:11:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:05,279 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2023-12-16 07:11:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-16 07:11:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-16 07:11:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:05,280 INFO L225 Difference]: With dead ends: 159 [2023-12-16 07:11:05,280 INFO L226 Difference]: Without dead ends: 157 [2023-12-16 07:11:05,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=749, Invalid=4653, Unknown=0, NotChecked=0, Total=5402 [2023-12-16 07:11:05,282 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 249 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:05,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 285 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 07:11:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-12-16 07:11:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 80. [2023-12-16 07:11:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 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-16 07:11:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2023-12-16 07:11:05,295 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 33 [2023-12-16 07:11:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:05,296 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2023-12-16 07:11:05,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:11:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2023-12-16 07:11:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 07:11:05,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:05,296 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 4, 3, 3, 1, 1, 1, 1, 1] [2023-12-16 07:11:05,301 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 (22)] Ended with exit code 0 [2023-12-16 07:11:05,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 07:11:05,497 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:05,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash 607754163, now seen corresponding path program 11 times [2023-12-16 07:11:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:05,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587147174] [2023-12-16 07:11:05,497 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 07:11:05,497 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-16 07:11:05,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:05,498 INFO L229 MonitoredProcess]: Starting monitored process 23 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-16 07:11:05,499 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 (23)] Waiting until timeout for monitored process [2023-12-16 07:11:05,602 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-12-16 07:11:05,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:11:05,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 07:11:05,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:05,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:11:05,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:05,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:11:06,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-16 07:11:06,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-12-16 07:11:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:06,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587147174] [2023-12-16 07:11:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587147174] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:11:06,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:11:06,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-12-16 07:11:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37764832] [2023-12-16 07:11:06,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:11:06,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-16 07:11:06,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:06,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-16 07:11:06,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2023-12-16 07:11:06,915 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:11:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:08,415 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2023-12-16 07:11:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-16 07:11:08,416 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-16 07:11:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:08,416 INFO L225 Difference]: With dead ends: 132 [2023-12-16 07:11:08,416 INFO L226 Difference]: Without dead ends: 130 [2023-12-16 07:11:08,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=343, Invalid=2737, Unknown=0, NotChecked=0, Total=3080 [2023-12-16 07:11:08,417 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 90 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:08,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 155 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 07:11:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-16 07:11:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 80. [2023-12-16 07:11:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 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-16 07:11:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2023-12-16 07:11:08,431 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 34 [2023-12-16 07:11:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:08,431 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2023-12-16 07:11:08,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:11:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2023-12-16 07:11:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 07:11:08,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:08,432 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 5, 4, 4, 1, 1, 1, 1, 1] [2023-12-16 07:11:08,436 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 (23)] Forceful destruction successful, exit code 0 [2023-12-16 07:11:08,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 07:11:08,635 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:08,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash -165497417, now seen corresponding path program 12 times [2023-12-16 07:11:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813845868] [2023-12-16 07:11:08,636 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 07:11:08,636 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-16 07:11:08,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:08,637 INFO L229 MonitoredProcess]: Starting monitored process 24 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-16 07:11:08,638 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 (24)] Waiting until timeout for monitored process [2023-12-16 07:11:08,769 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-12-16 07:11:08,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:11:08,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 07:11:08,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 4 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:08,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:11:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 5 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:09,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:09,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813845868] [2023-12-16 07:11:09,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813845868] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:11:09,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:11:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2023-12-16 07:11:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351549628] [2023-12-16 07:11:09,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:11:09,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-16 07:11:09,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:09,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-16 07:11:09,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 07:11:09,602 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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-16 07:11:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:10,203 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2023-12-16 07:11:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 07:11:10,205 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 35 [2023-12-16 07:11:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:10,205 INFO L225 Difference]: With dead ends: 105 [2023-12-16 07:11:10,205 INFO L226 Difference]: Without dead ends: 86 [2023-12-16 07:11:10,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=1257, Unknown=0, NotChecked=0, Total=1482 [2023-12-16 07:11:10,206 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:10,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 156 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 07:11:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-16 07:11:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2023-12-16 07:11:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 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-16 07:11:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2023-12-16 07:11:10,220 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 35 [2023-12-16 07:11:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:10,220 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2023-12-16 07:11:10,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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-16 07:11:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2023-12-16 07:11:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 07:11:10,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:10,220 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:11:10,226 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 (24)] Ended with exit code 0 [2023-12-16 07:11:10,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 07:11:10,423 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:10,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1056153353, now seen corresponding path program 13 times [2023-12-16 07:11:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:10,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991385422] [2023-12-16 07:11:10,424 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-16 07:11:10,424 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-16 07:11:10,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:10,424 INFO L229 MonitoredProcess]: Starting monitored process 25 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-16 07:11:10,425 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 (25)] Waiting until timeout for monitored process [2023-12-16 07:11:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:11:10,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-16 07:11:10,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:10,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:11:10,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:10,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:10,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:10,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:10,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:10,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:10,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:10,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:11:12,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2023-12-16 07:11:12,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4839106 treesize of output 4835010 [2023-12-16 07:11:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:12,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991385422] [2023-12-16 07:11:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991385422] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:11:12,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:11:12,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2023-12-16 07:11:12,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970276661] [2023-12-16 07:11:12,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:11:12,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-16 07:11:12,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:12,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-16 07:11:12,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2023-12-16 07:11:12,798 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 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-16 07:11:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:17,876 INFO L93 Difference]: Finished difference Result 224 states and 249 transitions. [2023-12-16 07:11:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-12-16 07:11:17,877 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-16 07:11:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:17,877 INFO L225 Difference]: With dead ends: 224 [2023-12-16 07:11:17,877 INFO L226 Difference]: Without dead ends: 222 [2023-12-16 07:11:17,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2545 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1794, Invalid=8306, Unknown=0, NotChecked=0, Total=10100 [2023-12-16 07:11:17,880 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 581 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:17,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 483 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 07:11:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-12-16 07:11:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 77. [2023-12-16 07:11:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 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-16 07:11:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2023-12-16 07:11:17,894 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 36 [2023-12-16 07:11:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:17,895 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2023-12-16 07:11:17,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 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-16 07:11:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2023-12-16 07:11:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 07:11:17,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:17,895 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 5, 4, 4, 1, 1, 1, 1, 1] [2023-12-16 07:11:17,900 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 (25)] Ended with exit code 0 [2023-12-16 07:11:18,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 07:11:18,096 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:18,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1972637474, now seen corresponding path program 14 times [2023-12-16 07:11:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:18,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359187839] [2023-12-16 07:11:18,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 07:11:18,096 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-16 07:11:18,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:18,097 INFO L229 MonitoredProcess]: Starting monitored process 26 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-16 07:11:18,098 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 (26)] Waiting until timeout for monitored process [2023-12-16 07:11:18,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 07:11:18,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:11:18,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 07:11:18,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:18,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:11:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:18,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:11:18,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-16 07:11:18,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-12-16 07:11:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:19,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359187839] [2023-12-16 07:11:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359187839] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:11:19,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:11:19,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2023-12-16 07:11:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658670782] [2023-12-16 07:11:19,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:11:19,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-16 07:11:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:19,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-16 07:11:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1031, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 07:11:19,670 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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-16 07:11:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:11:20,732 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2023-12-16 07:11:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 07:11:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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 37 [2023-12-16 07:11:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:11:20,733 INFO L225 Difference]: With dead ends: 100 [2023-12-16 07:11:20,733 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 07:11:20,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=137, Invalid=1423, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 07:11:20,734 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:20,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 251 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 07:11:20,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 07:11:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2023-12-16 07:11:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 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-16 07:11:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2023-12-16 07:11:20,750 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 37 [2023-12-16 07:11:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:11:20,750 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2023-12-16 07:11:20,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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-16 07:11:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2023-12-16 07:11:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 07:11:20,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:11:20,751 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 4, 3, 3, 1, 1, 1, 1, 1] [2023-12-16 07:11:20,756 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 (26)] Forceful destruction successful, exit code 0 [2023-12-16 07:11:20,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 07:11:20,954 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:11:20,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:11:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2025260389, now seen corresponding path program 15 times [2023-12-16 07:11:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:11:20,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501599879] [2023-12-16 07:11:20,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:11:20,955 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-16 07:11:20,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:11:20,956 INFO L229 MonitoredProcess]: Starting monitored process 27 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-16 07:11:20,956 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 (27)] Waiting until timeout for monitored process [2023-12-16 07:11:21,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-12-16 07:11:21,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:11:21,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-16 07:11:21,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:11:21,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-16 07:11:21,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:21,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:21,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-16 07:11:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:21,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:11:21,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-12-16 07:11:21,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4402 treesize of output 4338 [2023-12-16 07:11:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:11:22,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:11:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501599879] [2023-12-16 07:11:22,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501599879] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:11:22,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:11:22,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2023-12-16 07:11:22,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406175188] [2023-12-16 07:11:22,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:11:22,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-16 07:11:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:11:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-16 07:11:22,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2023-12-16 07:11:22,774 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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-16 07:11:26,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-16 07:11:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-16 07:11:27,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=511, Invalid=3521, Unknown=0, NotChecked=0, Total=4032 [2023-12-16 07:11:27,753 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-16 07:11:27,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 181 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-16 07:11:27,754 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 07:11:27,756 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-16 07:11:27,759 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 (27)] Forceful destruction successful, exit code 0 [2023-12-16 07:11:27,765 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 (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:11:27,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-16 07:11:27,954 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (81states) and FLOYD_HOARE automaton (currently 43 states, 36 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. [2023-12-16 07:11:27,958 INFO L445 BasicCegarLoop]: Path program histogram: [15, 5, 3, 1, 1, 1] [2023-12-16 07:11:27,959 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:11:27,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:11:27 BoogieIcfgContainer [2023-12-16 07:11:27,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:11:27,961 INFO L158 Benchmark]: Toolchain (without parser) took 74248.22ms. Allocated memory was 308.3MB in the beginning and 889.2MB in the end (delta: 580.9MB). Free memory was 257.8MB in the beginning and 555.2MB in the end (delta: -297.4MB). Peak memory consumption was 285.1MB. Max. memory is 8.0GB. [2023-12-16 07:11:27,961 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 224.4MB. Free memory is still 174.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:11:27,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.01ms. Allocated memory is still 308.3MB. Free memory was 257.5MB in the beginning and 246.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 07:11:27,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.20ms. Allocated memory is still 308.3MB. Free memory was 246.4MB in the beginning and 244.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:11:27,962 INFO L158 Benchmark]: Boogie Preprocessor took 24.39ms. Allocated memory is still 308.3MB. Free memory was 244.9MB in the beginning and 242.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:11:27,962 INFO L158 Benchmark]: RCFGBuilder took 295.60ms. Allocated memory is still 308.3MB. Free memory was 242.8MB in the beginning and 230.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 07:11:27,962 INFO L158 Benchmark]: TraceAbstraction took 73726.59ms. Allocated memory was 308.3MB in the beginning and 889.2MB in the end (delta: 580.9MB). Free memory was 229.5MB in the beginning and 555.2MB in the end (delta: -325.7MB). Peak memory consumption was 256.8MB. Max. memory is 8.0GB. [2023-12-16 07:11:27,963 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 224.4MB. Free memory is still 174.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.01ms. Allocated memory is still 308.3MB. Free memory was 257.5MB in the beginning and 246.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.20ms. Allocated memory is still 308.3MB. Free memory was 246.4MB in the beginning and 244.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.39ms. Allocated memory is still 308.3MB. Free memory was 244.9MB in the beginning and 242.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 295.60ms. Allocated memory is still 308.3MB. Free memory was 242.8MB in the beginning and 230.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 73726.59ms. Allocated memory was 308.3MB in the beginning and 889.2MB in the end (delta: 580.9MB). Free memory was 229.5MB in the beginning and 555.2MB in the end (delta: -325.7MB). Peak memory consumption was 256.8MB. 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: 8]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 8). Cancelled while NwaCegarLoop was constructing difference of abstraction (81states) and FLOYD_HOARE automaton (currently 43 states, 36 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.7s, OverallIterations: 26, TraceHistogramMax: 14, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 41.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3370 SdHoareTripleChecker+Valid, 19.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3370 mSDsluCounter, 3880 SdHoareTripleChecker+Invalid, 18.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3612 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9741 IncrementalHoareTripleChecker+Invalid, 9903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 268 mSDtfsCounter, 9741 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1548 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 911 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9246 ImplicationChecksByTransitivity, 36.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=25, InterpolantAutomatonStates: 647, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 851 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 1172 ConstructedInterpolants, 60 QuantifiedInterpolants, 14388 SizeOfPredicates, 121 NumberOfNonLiveVariables, 2229 ConjunctsInSsa, 536 ConjunctsInUnsatCore, 49 InterpolantComputations, 3 PerfectInterpolantSequences, 21/3610 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