/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-examples/standard_strcpy_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 16:40:16,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 16:40:16,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 16:40:16,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 16:40:16,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 16:40:16,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 16:40:16,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 16:40:16,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 16:40:16,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 16:40:16,535 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 16:40:16,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 16:40:16,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 16:40:16,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 16:40:16,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 16:40:16,537 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 16:40:16,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 16:40:16,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 16:40:16,538 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 16:40:16,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 16:40:16,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 16:40:16,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 16:40:16,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 16:40:16,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 16:40:16,540 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 16:40:16,540 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 16:40:16,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 16:40:16,540 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 16:40:16,540 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 16:40:16,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 16:40:16,541 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 16:40:16,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 16:40:16,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 16:40:16,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 16:40:16,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 16:40:16,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 16:40:16,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 16:40:16,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 16:40:16,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 16:40:16,543 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 16:40:16,543 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 16:40:16,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 16:40:16,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 16:40:16,543 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 16:40:16,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 16:40:16,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 16:40:16,544 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 16:40:16,544 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 16:40:16,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 16:40:16,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 16:40:16,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 16:40:16,742 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 16:40:16,745 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 16:40:16,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_ground-1.i [2023-12-21 16:40:17,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 16:40:17,846 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 16:40:17,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_ground-1.i [2023-12-21 16:40:17,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5a3cf08/30f7acbce97643139eab895d87578e3e/FLAG90f4f5767 [2023-12-21 16:40:17,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5a3cf08/30f7acbce97643139eab895d87578e3e [2023-12-21 16:40:17,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 16:40:17,868 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 16:40:17,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 16:40:17,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 16:40:17,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 16:40:17,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:40:17" (1/1) ... [2023-12-21 16:40:17,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23075c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:17, skipping insertion in model container [2023-12-21 16:40:17,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:40:17" (1/1) ... [2023-12-21 16:40:17,890 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 16:40:17,992 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-examples/standard_strcpy_ground-1.i[853,866] [2023-12-21 16:40:18,001 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 16:40:18,008 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 16:40:18,022 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-examples/standard_strcpy_ground-1.i[853,866] [2023-12-21 16:40:18,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 16:40:18,045 INFO L206 MainTranslator]: Completed translation [2023-12-21 16:40:18,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18 WrapperNode [2023-12-21 16:40:18,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 16:40:18,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 16:40:18,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 16:40:18,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 16:40:18,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,069 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-12-21 16:40:18,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 16:40:18,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 16:40:18,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 16:40:18,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 16:40:18,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,090 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 4, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-12-21 16:40:18,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 16:40:18,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 16:40:18,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 16:40:18,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 16:40:18,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (1/1) ... [2023-12-21 16:40:18,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 16:40:18,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 16:40:18,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 16:40:18,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 16:40:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 16:40:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 16:40:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 16:40:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 16:40:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 16:40:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 16:40:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 16:40:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 16:40:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 16:40:18,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 16:40:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 16:40:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 16:40:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 16:40:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 16:40:18,215 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 16:40:18,217 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 16:40:18,309 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 16:40:18,342 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 16:40:18,342 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 16:40:18,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:40:18 BoogieIcfgContainer [2023-12-21 16:40:18,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 16:40:18,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 16:40:18,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 16:40:18,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 16:40:18,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 04:40:17" (1/3) ... [2023-12-21 16:40:18,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd2871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:40:18, skipping insertion in model container [2023-12-21 16:40:18,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:40:18" (2/3) ... [2023-12-21 16:40:18,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd2871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:40:18, skipping insertion in model container [2023-12-21 16:40:18,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:40:18" (3/3) ... [2023-12-21 16:40:18,348 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_ground-1.i [2023-12-21 16:40:18,363 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 16:40:18,364 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 16:40:18,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 16:40:18,406 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;@5c8afe44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 16:40:18,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 16:40:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 16:40:18,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:40:18,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:40:18,416 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:40:18,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:40:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2108282814, now seen corresponding path program 1 times [2023-12-21 16:40:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:40:18,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756104918] [2023-12-21 16:40:18,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:40:18,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:18,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:40:18,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:40:18,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 16:40:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:40:18,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 16:40:18,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:40:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 16:40:18,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 16:40:18,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:40:18,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756104918] [2023-12-21 16:40:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756104918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 16:40:18,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 16:40:18,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 16:40:18,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718701417] [2023-12-21 16:40:18,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 16:40:18,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 16:40:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:40:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 16:40:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 16:40:18,539 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-21 16:40:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:40:18,554 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2023-12-21 16:40:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 16:40:18,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-21 16:40:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:40:18,561 INFO L225 Difference]: With dead ends: 24 [2023-12-21 16:40:18,561 INFO L226 Difference]: Without dead ends: 11 [2023-12-21 16:40:18,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 16:40:18,564 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:40:18,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:40:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-21 16:40:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-21 16:40:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2023-12-21 16:40:18,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 7 [2023-12-21 16:40:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:40:18,586 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2023-12-21 16:40:18,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-21 16:40:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2023-12-21 16:40:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 16:40:18,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:40:18,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:40:18,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 16:40:18,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:18,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:40:18,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:40:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash -174235625, now seen corresponding path program 1 times [2023-12-21 16:40:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:40:18,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989981925] [2023-12-21 16:40:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:40:18,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:18,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:40:18,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:40:18,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 16:40:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:40:18,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 16:40:18,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:40:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 16:40:18,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 16:40:18,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:40:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989981925] [2023-12-21 16:40:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989981925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 16:40:18,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 16:40:18,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 16:40:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194146751] [2023-12-21 16:40:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 16:40:18,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 16:40:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:40:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 16:40:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 16:40:18,872 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:40:18,885 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2023-12-21 16:40:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 16:40:18,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-21 16:40:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:40:18,886 INFO L225 Difference]: With dead ends: 21 [2023-12-21 16:40:18,887 INFO L226 Difference]: Without dead ends: 12 [2023-12-21 16:40:18,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-21 16:40:18,890 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:40:18,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:40:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-21 16:40:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-21 16:40:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2023-12-21 16:40:18,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 9 [2023-12-21 16:40:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:40:18,895 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-12-21 16:40:18,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2023-12-21 16:40:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 16:40:18,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:40:18,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:40:18,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 16:40:19,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:19,097 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:40:19,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:40:19,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1771770842, now seen corresponding path program 1 times [2023-12-21 16:40:19,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:40:19,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898730748] [2023-12-21 16:40:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:40:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:40:19,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:40:19,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 16:40:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:40:19,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 16:40:19,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:40:19,169 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-21 16:40:19,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:40:19,186 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-21 16:40:19,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:40:19,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898730748] [2023-12-21 16:40:19,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898730748] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:40:19,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:40:19,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-21 16:40:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320269111] [2023-12-21 16:40:19,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:40:19,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 16:40:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:40:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 16:40:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 16:40:19,188 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-21 16:40:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:40:19,219 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2023-12-21 16:40:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 16:40:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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) Word has length 10 [2023-12-21 16:40:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:40:19,220 INFO L225 Difference]: With dead ends: 24 [2023-12-21 16:40:19,220 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 16:40:19,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-21 16:40:19,221 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:40:19,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:40:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 16:40:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 16:40:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-21 16:40:19,224 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2023-12-21 16:40:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:40:19,224 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-21 16:40:19,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 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-21 16:40:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-21 16:40:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 16:40:19,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:40:19,225 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:40:19,229 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-21 16:40:19,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:19,427 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:40:19,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:40:19,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1322816553, now seen corresponding path program 2 times [2023-12-21 16:40:19,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:40:19,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751785271] [2023-12-21 16:40:19,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 16:40:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:40:19,429 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:40:19,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 16:40:19,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 16:40:19,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:40:19,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 16:40:19,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:40:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 16:40:19,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 16:40:19,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:40:19,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751785271] [2023-12-21 16:40:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751785271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 16:40:19,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 16:40:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 16:40:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268642139] [2023-12-21 16:40:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 16:40:19,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 16:40:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:40:19,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 16:40:19,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 16:40:19,495 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:40:19,520 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2023-12-21 16:40:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 16:40:19,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 16:40:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:40:19,521 INFO L225 Difference]: With dead ends: 25 [2023-12-21 16:40:19,521 INFO L226 Difference]: Without dead ends: 18 [2023-12-21 16:40:19,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-21 16:40:19,522 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:40:19,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:40:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-21 16:40:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-21 16:40:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-21 16:40:19,526 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2023-12-21 16:40:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:40:19,526 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-21 16:40:19,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-21 16:40:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 16:40:19,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:40:19,527 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:40:19,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 16:40:19,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:19,733 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:40:19,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:40:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash 766348371, now seen corresponding path program 1 times [2023-12-21 16:40:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:40:19,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299154153] [2023-12-21 16:40:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:40:19,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:19,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:40:19,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:40:19,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 16:40:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:40:19,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 16:40:19,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:40:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 16:40:19,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:40:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 16:40:19,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:40:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299154153] [2023-12-21 16:40:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299154153] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:40:19,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:40:19,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-21 16:40:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302685974] [2023-12-21 16:40:19,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:40:19,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 16:40:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:40:19,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 16:40:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 16:40:19,905 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:40:20,043 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-12-21 16:40:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 16:40:20,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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) Word has length 16 [2023-12-21 16:40:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:40:20,044 INFO L225 Difference]: With dead ends: 36 [2023-12-21 16:40:20,044 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 16:40:20,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 16:40:20,045 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:40:20,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:40:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 16:40:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-21 16:40:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-12-21 16:40:20,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2023-12-21 16:40:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:40:20,050 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-12-21 16:40:20,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-12-21 16:40:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 16:40:20,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:40:20,050 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:40:20,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 16:40:20,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:20,256 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:40:20,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:40:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1360569677, now seen corresponding path program 2 times [2023-12-21 16:40:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:40:20,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725335637] [2023-12-21 16:40:20,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 16:40:20,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:20,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:40:20,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:40:20,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 16:40:20,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 16:40:20,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:40:20,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 16:40:20,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:40:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 16:40:20,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:40:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 16:40:20,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:40:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725335637] [2023-12-21 16:40:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725335637] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:40:20,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:40:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-21 16:40:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013052820] [2023-12-21 16:40:20,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:40:20,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 16:40:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:40:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 16:40:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 16:40:20,711 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:40:21,525 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2023-12-21 16:40:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 16:40:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-21 16:40:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:40:21,529 INFO L225 Difference]: With dead ends: 48 [2023-12-21 16:40:21,529 INFO L226 Difference]: Without dead ends: 36 [2023-12-21 16:40:21,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 16:40:21,530 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 16:40:21,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 16:40:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-21 16:40:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-21 16:40:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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-21 16:40:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-12-21 16:40:21,538 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2023-12-21 16:40:21,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:40:21,538 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-12-21 16:40:21,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-12-21 16:40:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 16:40:21,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:40:21,539 INFO L195 NwaCegarLoop]: trace histogram [22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:40:21,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-21 16:40:21,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:21,743 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:40:21,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:40:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 259792755, now seen corresponding path program 3 times [2023-12-21 16:40:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:40:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338124610] [2023-12-21 16:40:21,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 16:40:21,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:21,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:40:21,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:40:21,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 16:40:21,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 16:40:21,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:40:21,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 16:40:21,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:40:21,998 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 15 treesize of output 11 [2023-12-21 16:40:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 16:40:22,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:40:22,128 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-12-21 16:40:22,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2023-12-21 16:40:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-21 16:40:22,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:40:22,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338124610] [2023-12-21 16:40:22,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338124610] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:40:22,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:40:22,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-21 16:40:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752768264] [2023-12-21 16:40:22,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:40:22,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 16:40:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:40:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 16:40:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-21 16:40:22,187 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:40:22,280 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-12-21 16:40:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 16:40:22,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-21 16:40:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:40:22,281 INFO L225 Difference]: With dead ends: 41 [2023-12-21 16:40:22,281 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 16:40:22,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-21 16:40:22,282 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 16:40:22,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 47 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 16:40:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 16:40:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2023-12-21 16:40:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-12-21 16:40:22,289 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 34 [2023-12-21 16:40:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:40:22,289 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-12-21 16:40:22,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-12-21 16:40:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 16:40:22,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:40:22,290 INFO L195 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:40:22,298 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-21 16:40:22,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:22,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:40:22,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:40:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash -39997906, now seen corresponding path program 1 times [2023-12-21 16:40:22,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:40:22,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032498089] [2023-12-21 16:40:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 16:40:22,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:22,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:40:22,497 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:40:22,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 16:40:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:40:22,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 16:40:22,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:40:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 16:40:22,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:40:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 16:40:23,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:40:23,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032498089] [2023-12-21 16:40:23,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032498089] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:40:23,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:40:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-21 16:40:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135222461] [2023-12-21 16:40:23,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:40:23,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 16:40:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:40:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 16:40:23,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 16:40:23,949 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 48 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 47 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-21 16:40:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:40:29,310 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2023-12-21 16:40:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-21 16:40:29,311 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 47 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 37 [2023-12-21 16:40:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:40:29,311 INFO L225 Difference]: With dead ends: 76 [2023-12-21 16:40:29,311 INFO L226 Difference]: Without dead ends: 62 [2023-12-21 16:40:29,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 16:40:29,313 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 16:40:29,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 16:40:29,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-21 16:40:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-21 16:40:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:40:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-12-21 16:40:29,321 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 37 [2023-12-21 16:40:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:40:29,321 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-12-21 16:40:29,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 47 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-21 16:40:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-12-21 16:40:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 16:40:29,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:40:29,323 INFO L195 NwaCegarLoop]: trace histogram [46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:40:29,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-21 16:40:29,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:29,526 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:40:29,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:40:29,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1193612462, now seen corresponding path program 2 times [2023-12-21 16:40:29,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:40:29,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276079324] [2023-12-21 16:40:29,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 16:40:29,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:40:29,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:40:29,528 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:40:29,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 16:40:29,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 16:40:29,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:40:29,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 16:40:29,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:40:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 16:40:30,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:40:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 16:40:35,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:40:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276079324] [2023-12-21 16:40:35,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276079324] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:40:35,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:40:35,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2023-12-21 16:40:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657595087] [2023-12-21 16:40:35,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:40:35,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-21 16:40:35,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:40:35,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-21 16:40:35,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2023-12-21 16:40:35,064 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 96 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:41:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:41:19,332 INFO L93 Difference]: Finished difference Result 124 states and 179 transitions. [2023-12-21 16:41:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-21 16:41:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 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 61 [2023-12-21 16:41:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:41:19,334 INFO L225 Difference]: With dead ends: 124 [2023-12-21 16:41:19,334 INFO L226 Difference]: Without dead ends: 110 [2023-12-21 16:41:19,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 48.0s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2023-12-21 16:41:19,338 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 2401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 16:41:19,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2401 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 16:41:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-21 16:41:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-12-21 16:41:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:41:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2023-12-21 16:41:19,357 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 61 [2023-12-21 16:41:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:41:19,357 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2023-12-21 16:41:19,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:41:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2023-12-21 16:41:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-21 16:41:19,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:41:19,359 INFO L195 NwaCegarLoop]: trace histogram [94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:41:19,363 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-21 16:41:19,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:41:19,563 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:41:19,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:41:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1708039762, now seen corresponding path program 3 times [2023-12-21 16:41:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:41:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167024039] [2023-12-21 16:41:19,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 16:41:19,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:41:19,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:41:19,567 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:41:19,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 16:41:19,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 16:41:19,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:41:19,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 16:41:19,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:41:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2023-12-21 16:41:19,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:41:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2023-12-21 16:41:19,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:41:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167024039] [2023-12-21 16:41:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167024039] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:41:19,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:41:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-21 16:41:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325786208] [2023-12-21 16:41:19,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:41:19,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 16:41:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:41:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 16:41:19,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-21 16:41:19,982 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:41:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:41:20,038 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2023-12-21 16:41:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 16:41:20,039 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 109 [2023-12-21 16:41:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:41:20,039 INFO L225 Difference]: With dead ends: 123 [2023-12-21 16:41:20,039 INFO L226 Difference]: Without dead ends: 113 [2023-12-21 16:41:20,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-21 16:41:20,040 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:41:20,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 16:41:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-21 16:41:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-21 16:41:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0535714285714286) internal successors, (118), 112 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:41:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2023-12-21 16:41:20,051 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 109 [2023-12-21 16:41:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:41:20,052 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2023-12-21 16:41:20,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:41:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2023-12-21 16:41:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 16:41:20,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:41:20,053 INFO L195 NwaCegarLoop]: trace histogram [94, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:41:20,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-21 16:41:20,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:41:20,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:41:20,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:41:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 645841002, now seen corresponding path program 4 times [2023-12-21 16:41:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:41:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324852685] [2023-12-21 16:41:20,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 16:41:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:41:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:41:20,257 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:41:20,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 16:41:20,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 16:41:20,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:41:20,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-21 16:41:20,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:41:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4476 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 16:41:23,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:41:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4476 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 16:41:42,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:41:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324852685] [2023-12-21 16:41:42,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324852685] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:41:42,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:41:42,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 191 [2023-12-21 16:41:42,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162698104] [2023-12-21 16:41:42,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:41:42,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2023-12-21 16:41:42,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:41:42,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2023-12-21 16:41:42,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9406, Invalid=27266, Unknown=0, NotChecked=0, Total=36672 [2023-12-21 16:41:42,261 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand has 192 states, 192 states have (on average 1.0520833333333333) internal successors, (202), 191 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:49:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:49:18,820 INFO L93 Difference]: Finished difference Result 226 states and 331 transitions. [2023-12-21 16:49:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2023-12-21 16:49:18,820 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 192 states have (on average 1.0520833333333333) internal successors, (202), 191 states have internal predecessors, (202), 0 states have call successors, (0), 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 112 [2023-12-21 16:49:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:49:18,821 INFO L225 Difference]: With dead ends: 226 [2023-12-21 16:49:18,821 INFO L226 Difference]: Without dead ends: 209 [2023-12-21 16:49:18,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 472.7s TimeCoverageRelationStatistics Valid=27454, Invalid=54056, Unknown=0, NotChecked=0, Total=81510 [2023-12-21 16:49:18,827 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 9417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 9418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-21 16:49:18,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1011 Invalid, 9418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9417 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-21 16:49:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-21 16:49:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2023-12-21 16:49:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.0288461538461537) internal successors, (214), 208 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:49:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 214 transitions. [2023-12-21 16:49:18,853 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 214 transitions. Word has length 112 [2023-12-21 16:49:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:49:18,853 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 214 transitions. [2023-12-21 16:49:18,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 192 states have (on average 1.0520833333333333) internal successors, (202), 191 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:49:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 214 transitions. [2023-12-21 16:49:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-21 16:49:18,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:49:18,856 INFO L195 NwaCegarLoop]: trace histogram [190, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 16:49:18,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-21 16:49:19,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:49:19,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:49:19,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:49:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2108810858, now seen corresponding path program 5 times [2023-12-21 16:49:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:49:19,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368619520] [2023-12-21 16:49:19,061 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 16:49:19,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:49:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:49:19,062 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:49:19,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-21 16:49:39,265 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2023-12-21 16:49:39,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:49:39,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 16:49:39,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:49:40,209 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 15 treesize of output 11 [2023-12-21 16:49:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18156 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 17955 trivial. 0 not checked. [2023-12-21 16:49:40,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:49:40,442 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-12-21 16:49:40,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2023-12-21 16:49:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18156 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2023-12-21 16:49:40,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:49:40,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368619520] [2023-12-21 16:49:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368619520] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:49:40,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:49:40,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-12-21 16:49:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655880989] [2023-12-21 16:49:40,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:49:40,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 16:49:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:49:40,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 16:49:40,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-21 16:49:40,753 INFO L87 Difference]: Start difference. First operand 209 states and 214 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:49:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:49:40,944 INFO L93 Difference]: Finished difference Result 215 states and 220 transitions. [2023-12-21 16:49:40,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 16:49:40,944 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 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 208 [2023-12-21 16:49:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:49:40,945 INFO L225 Difference]: With dead ends: 215 [2023-12-21 16:49:40,945 INFO L226 Difference]: Without dead ends: 213 [2023-12-21 16:49:40,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-12-21 16:49:40,946 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 16:49:40,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 72 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 16:49:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-21 16:49:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2023-12-21 16:49:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.028436018957346) internal successors, (217), 211 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:49:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 217 transitions. [2023-12-21 16:49:40,966 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 217 transitions. Word has length 208 [2023-12-21 16:49:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:49:40,967 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 217 transitions. [2023-12-21 16:49:40,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:49:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 217 transitions. [2023-12-21 16:49:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-12-21 16:49:40,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:49:40,968 INFO L195 NwaCegarLoop]: trace histogram [190, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-21 16:49:40,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-21 16:49:41,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:49:41,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:49:41,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:49:41,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1102737367, now seen corresponding path program 6 times [2023-12-21 16:49:41,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:49:41,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291887152] [2023-12-21 16:49:41,193 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 16:49:41,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:49:41,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:49:41,194 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:49:41,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-21 16:49:41,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-12-21 16:49:41,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 16:49:41,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 16:49:41,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:49:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18161 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2023-12-21 16:49:41,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:49:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18161 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2023-12-21 16:49:42,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:49:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291887152] [2023-12-21 16:49:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291887152] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:49:42,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:49:42,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-12-21 16:49:42,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821930944] [2023-12-21 16:49:42,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:49:42,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 16:49:42,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:49:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 16:49:42,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-12-21 16:49:42,458 INFO L87 Difference]: Start difference. First operand 212 states and 217 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:49:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 16:49:42,564 INFO L93 Difference]: Finished difference Result 238 states and 248 transitions. [2023-12-21 16:49:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 16:49:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2023-12-21 16:49:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 16:49:42,565 INFO L225 Difference]: With dead ends: 238 [2023-12-21 16:49:42,565 INFO L226 Difference]: Without dead ends: 216 [2023-12-21 16:49:42,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-12-21 16:49:42,566 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 16:49:42,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 16:49:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-21 16:49:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2023-12-21 16:49:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.02803738317757) internal successors, (220), 214 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:49:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 220 transitions. [2023-12-21 16:49:42,583 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 220 transitions. Word has length 211 [2023-12-21 16:49:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 16:49:42,583 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 220 transitions. [2023-12-21 16:49:42,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:49:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 220 transitions. [2023-12-21 16:49:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-21 16:49:42,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 16:49:42,584 INFO L195 NwaCegarLoop]: trace histogram [190, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-21 16:49:42,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-21 16:49:42,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:49:42,787 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 16:49:42,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 16:49:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1951900269, now seen corresponding path program 7 times [2023-12-21 16:49:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 16:49:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150285172] [2023-12-21 16:49:42,788 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 16:49:42,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:49:42,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 16:49:42,789 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 16:49:42,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-21 16:49:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 16:49:43,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 192 conjunts are in the unsatisfiable core [2023-12-21 16:49:43,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 16:49:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18170 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-21 16:49:55,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 16:51:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18170 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-21 16:51:11,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 16:51:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150285172] [2023-12-21 16:51:11,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150285172] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 16:51:11,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 16:51:11,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192] total 383 [2023-12-21 16:51:11,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699530559] [2023-12-21 16:51:11,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 16:51:11,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2023-12-21 16:51:11,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 16:51:11,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2023-12-21 16:51:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37246, Invalid=109826, Unknown=0, NotChecked=0, Total=147072 [2023-12-21 16:51:11,867 INFO L87 Difference]: Start difference. First operand 215 states and 220 transitions. Second operand has 384 states, 384 states have (on average 1.0260416666666667) internal successors, (394), 383 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 16:51:55,174 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 574 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 16:52:19,346 WARN L293 SmtUtils]: Spent 7.70s on a formula simplification. DAG size of input: 571 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 16:52:44,233 WARN L293 SmtUtils]: Spent 7.98s on a formula simplification. DAG size of input: 568 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 16:53:11,402 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 565 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 16:53:38,642 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 562 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 16:54:05,855 WARN L293 SmtUtils]: Spent 7.38s on a formula simplification. DAG size of input: 559 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 16:54:34,368 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 556 DAG size of output: 7 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-21 16:54:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2023-12-21 16:54:48,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 389 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 270.1s TimeCoverageRelationStatistics Valid=39934, Invalid=112556, Unknown=0, NotChecked=0, Total=152490 [2023-12-21 16:54:48,260 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36680 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2023-12-21 16:54:48,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 36681 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 36680 Invalid, 0 Unknown, 0 Unchecked, 18.0s Time] [2023-12-21 16:54:48,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 16:54:48,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-21 16:54:48,286 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 16:54:48,286 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 (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 16:54:48,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 16:54:48,461 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (215states) and FLOYD_HOARE automaton (currently 200 states, 384 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 391 known predicates. [2023-12-21 16:54:48,465 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1] [2023-12-21 16:54:48,466 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 16:54:48,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 04:54:48 BoogieIcfgContainer [2023-12-21 16:54:48,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 16:54:48,468 INFO L158 Benchmark]: Toolchain (without parser) took 870600.01ms. Allocated memory was 183.5MB in the beginning and 317.7MB in the end (delta: 134.2MB). Free memory was 138.1MB in the beginning and 181.7MB in the end (delta: -43.6MB). Peak memory consumption was 216.2MB. Max. memory is 8.0GB. [2023-12-21 16:54:48,468 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 16:54:48,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.03ms. Allocated memory is still 183.5MB. Free memory was 138.1MB in the beginning and 126.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 16:54:48,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.88ms. Allocated memory is still 183.5MB. Free memory was 126.5MB in the beginning and 125.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 16:54:48,468 INFO L158 Benchmark]: Boogie Preprocessor took 34.18ms. Allocated memory is still 183.5MB. Free memory was 125.1MB in the beginning and 123.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 16:54:48,468 INFO L158 Benchmark]: RCFGBuilder took 237.47ms. Allocated memory is still 183.5MB. Free memory was 123.0MB in the beginning and 109.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 16:54:48,469 INFO L158 Benchmark]: TraceAbstraction took 870123.76ms. Allocated memory was 183.5MB in the beginning and 317.7MB in the end (delta: 134.2MB). Free memory was 108.7MB in the beginning and 181.7MB in the end (delta: -73.0MB). Peak memory consumption was 186.8MB. Max. memory is 8.0GB. [2023-12-21 16:54:48,469 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 183.5MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.03ms. Allocated memory is still 183.5MB. Free memory was 138.1MB in the beginning and 126.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.88ms. Allocated memory is still 183.5MB. Free memory was 126.5MB in the beginning and 125.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.18ms. Allocated memory is still 183.5MB. Free memory was 125.1MB in the beginning and 123.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 237.47ms. Allocated memory is still 183.5MB. Free memory was 123.0MB in the beginning and 109.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 870123.76ms. Allocated memory was 183.5MB in the beginning and 317.7MB in the end (delta: 134.2MB). Free memory was 108.7MB in the beginning and 181.7MB in the end (delta: -73.0MB). Peak memory consumption was 186.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: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while NwaCegarLoop was constructing difference of abstraction (215states) and FLOYD_HOARE automaton (currently 200 states, 384 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 391 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 870.1s, OverallIterations: 14, TraceHistogramMax: 190, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 724.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 25.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 2328 SdHoareTripleChecker+Invalid, 21.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2192 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49754 IncrementalHoareTripleChecker+Invalid, 49768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 136 mSDtfsCounter, 49754 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2262 GetRequests, 1276 SyntacticMatches, 0 SemanticMatches, 985 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5842 ImplicationChecksByTransitivity, 798.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=13, InterpolantAutomatonStates: 421, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 20.7s SatisfiabilityAnalysisTime, 120.9s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 2072 ConstructedInterpolants, 0 QuantifiedInterpolants, 11284 SizeOfPredicates, 30 NumberOfNonLiveVariables, 3599 ConjunctsInSsa, 429 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 81947/130220 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