/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/loop-simple/nested_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:38:41,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:38:41,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:38:41,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:38:41,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:38:41,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:38:41,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:38:41,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:38:41,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:38:41,204 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:38:41,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:38:41,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:38:41,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:38:41,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:38:41,206 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:38:41,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:38:41,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:38:41,206 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:38:41,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:38:41,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:38:41,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:38:41,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:38:41,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:38:41,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:38:41,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:38:41,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:38:41,208 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:38:41,208 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:38:41,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:38:41,208 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:38:41,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:38:41,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:38:41,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:38:41,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:38:41,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:38:41,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:38:41,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:38:41,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:38:41,210 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:38:41,210 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:38:41,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:38:41,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:38:41,210 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:38:41,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:38:41,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:38:41,211 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:38:41,211 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:38:41,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:38:41,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:38:41,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:38:41,404 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:38:41,404 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:38:41,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_6.c [2023-12-16 16:38:42,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:38:42,545 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:38:42,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_6.c [2023-12-16 16:38:42,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9de91953/b6aca68862b9486f955f23791dba3de4/FLAG47f0934f4 [2023-12-16 16:38:42,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9de91953/b6aca68862b9486f955f23791dba3de4 [2023-12-16 16:38:42,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:38:42,567 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:38:42,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:38:42,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:38:42,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:38:42,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1657990f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42, skipping insertion in model container [2023-12-16 16:38:42,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,590 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:38:42,695 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_6.c[959,972] [2023-12-16 16:38:42,698 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:38:42,706 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:38:42,716 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_6.c[959,972] [2023-12-16 16:38:42,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:38:42,725 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:38:42,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42 WrapperNode [2023-12-16 16:38:42,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:38:42,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:38:42,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:38:42,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:38:42,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,746 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2023-12-16 16:38:42,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:38:42,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:38:42,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:38:42,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:38:42,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,760 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 16:38:42,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:38:42,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:38:42,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:38:42,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:38:42,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (1/1) ... [2023-12-16 16:38:42,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:38:42,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:38:42,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:38:42,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:38:42,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:38:42,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:38:42,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:38:42,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:38:42,881 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:38:42,884 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:38:42,983 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:38:43,020 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:38:43,020 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-16 16:38:43,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:38:43 BoogieIcfgContainer [2023-12-16 16:38:43,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:38:43,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:38:43,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:38:43,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:38:43,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:38:42" (1/3) ... [2023-12-16 16:38:43,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25710f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:38:43, skipping insertion in model container [2023-12-16 16:38:43,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:38:42" (2/3) ... [2023-12-16 16:38:43,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25710f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:38:43, skipping insertion in model container [2023-12-16 16:38:43,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:38:43" (3/3) ... [2023-12-16 16:38:43,029 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_6.c [2023-12-16 16:38:43,041 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:38:43,041 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:38:43,077 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:38:43,081 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;@6fcb8546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:38:43,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:38:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 16:38:43,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:43,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 16:38:43,090 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:43,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 3585105, now seen corresponding path program 1 times [2023-12-16 16:38:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:43,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647889722] [2023-12-16 16:38:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:43,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:43,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:43,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:38:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:43,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:38:43,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:43,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:43,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:43,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647889722] [2023-12-16 16:38:43,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647889722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:43,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:43,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:38:43,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256991871] [2023-12-16 16:38:43,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:43,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:38:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:43,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:38:43,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:43,207 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:43,236 INFO L93 Difference]: Finished difference Result 44 states and 80 transitions. [2023-12-16 16:38:43,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:38:43,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-12-16 16:38:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:43,242 INFO L225 Difference]: With dead ends: 44 [2023-12-16 16:38:43,242 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 16:38:43,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:43,247 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:43,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 16:38:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2023-12-16 16:38:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2023-12-16 16:38:43,295 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 4 [2023-12-16 16:38:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:43,295 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2023-12-16 16:38:43,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2023-12-16 16:38:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 16:38:43,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:43,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:43,300 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-16 16:38:43,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:43,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:43,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash -570517697, now seen corresponding path program 1 times [2023-12-16 16:38:43,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:43,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133567797] [2023-12-16 16:38:43,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:43,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:43,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:43,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:43,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:38:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:43,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:38:43,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:43,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:43,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133567797] [2023-12-16 16:38:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133567797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:43,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:38:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005288391] [2023-12-16 16:38:43,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:43,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:38:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:43,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:38:43,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:43,531 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:43,547 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2023-12-16 16:38:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:38:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 16:38:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:43,547 INFO L225 Difference]: With dead ends: 39 [2023-12-16 16:38:43,548 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 16:38:43,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:43,549 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:43,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 16:38:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2023-12-16 16:38:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 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-16 16:38:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-12-16 16:38:43,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 7 [2023-12-16 16:38:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:43,552 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-12-16 16:38:43,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-12-16 16:38:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:38:43,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:43,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:43,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:43,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:43,757 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:43,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash 93320997, now seen corresponding path program 1 times [2023-12-16 16:38:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917490969] [2023-12-16 16:38:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:43,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:43,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:43,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:38:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:43,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:38:43,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:43,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:43,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917490969] [2023-12-16 16:38:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917490969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:38:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345251592] [2023-12-16 16:38:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:43,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:38:43,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:38:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:43,800 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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-16 16:38:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:43,814 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2023-12-16 16:38:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:38:43,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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 10 [2023-12-16 16:38:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:43,814 INFO L225 Difference]: With dead ends: 39 [2023-12-16 16:38:43,815 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 16:38:43,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:43,816 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:43,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 29 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 16:38:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2023-12-16 16:38:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-12-16 16:38:43,826 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 10 [2023-12-16 16:38:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:43,826 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-12-16 16:38:43,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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-16 16:38:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-12-16 16:38:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 16:38:43,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:43,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:43,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:44,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:44,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:44,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1298144171, now seen corresponding path program 1 times [2023-12-16 16:38:44,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:44,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65878370] [2023-12-16 16:38:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:44,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:44,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:44,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:44,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:38:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:44,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:38:44,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:44,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:44,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65878370] [2023-12-16 16:38:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65878370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:44,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:44,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:38:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692648555] [2023-12-16 16:38:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:44,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:38:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:38:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:44,090 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:44,110 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2023-12-16 16:38:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:38:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 13 [2023-12-16 16:38:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:44,112 INFO L225 Difference]: With dead ends: 39 [2023-12-16 16:38:44,112 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 16:38:44,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:44,113 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:44,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 16:38:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2023-12-16 16:38:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-12-16 16:38:44,119 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2023-12-16 16:38:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:44,119 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-12-16 16:38:44,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-12-16 16:38:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 16:38:44,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:44,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:44,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 16:38:44,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:44,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:44,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash -807538647, now seen corresponding path program 1 times [2023-12-16 16:38:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056064401] [2023-12-16 16:38:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:44,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:44,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:44,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:44,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:38:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:44,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:38:44,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:44,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:44,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:44,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056064401] [2023-12-16 16:38:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056064401] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:44,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:38:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306685978] [2023-12-16 16:38:44,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:44,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:38:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:44,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:38:44,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:44,388 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:44,412 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2023-12-16 16:38:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:38:44,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-16 16:38:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:44,414 INFO L225 Difference]: With dead ends: 39 [2023-12-16 16:38:44,414 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 16:38:44,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:44,415 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:44,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 16:38:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-12-16 16:38:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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-16 16:38:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-16 16:38:44,418 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 16 [2023-12-16 16:38:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:44,418 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-16 16:38:44,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-16 16:38:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 16:38:44,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:44,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:44,431 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-16 16:38:44,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:44,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:44,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2142527047, now seen corresponding path program 1 times [2023-12-16 16:38:44,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:44,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088249051] [2023-12-16 16:38:44,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:44,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:44,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:44,626 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:44,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:38:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:44,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:38:44,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:44,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:38:44,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:44,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088249051] [2023-12-16 16:38:44,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088249051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:38:44,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:38:44,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:38:44,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139331582] [2023-12-16 16:38:44,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:38:44,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:38:44,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:44,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:38:44,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:44,662 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:44,676 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-12-16 16:38:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:38:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-16 16:38:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:44,677 INFO L225 Difference]: With dead ends: 39 [2023-12-16 16:38:44,678 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 16:38:44,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:38:44,684 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 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-16 16:38:44,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 16:38:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-16 16:38:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-16 16:38:44,687 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 19 [2023-12-16 16:38:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:44,687 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-16 16:38:44,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-16 16:38:44,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 16:38:44,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:44,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:44,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:44,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:44,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:44,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1964421968, now seen corresponding path program 1 times [2023-12-16 16:38:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158768399] [2023-12-16 16:38:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:38:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:44,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:44,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:44,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:38:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:44,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:38:44,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:44,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:44,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158768399] [2023-12-16 16:38:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158768399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:44,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:44,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 16:38:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561647583] [2023-12-16 16:38:44,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:44,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:38:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:44,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:38:44,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:38:44,971 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:45,015 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2023-12-16 16:38:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:38:45,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-16 16:38:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:45,017 INFO L225 Difference]: With dead ends: 43 [2023-12-16 16:38:45,018 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 16:38:45,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:38:45,018 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:45,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 16:38:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-16 16:38:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-16 16:38:45,021 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2023-12-16 16:38:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:45,022 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-16 16:38:45,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-16 16:38:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 16:38:45,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:45,022 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:45,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:45,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:45,227 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:45,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash -265955193, now seen corresponding path program 2 times [2023-12-16 16:38:45,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:45,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668015683] [2023-12-16 16:38:45,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:38:45,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:45,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:45,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:45,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:38:45,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:38:45,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:45,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:38:45,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:45,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:38:45,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668015683] [2023-12-16 16:38:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668015683] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:45,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:38:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170086966] [2023-12-16 16:38:45,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:45,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:38:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:38:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:45,365 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:45,406 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2023-12-16 16:38:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:38:45,406 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-16 16:38:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:45,407 INFO L225 Difference]: With dead ends: 48 [2023-12-16 16:38:45,407 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 16:38:45,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:45,409 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:45,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 16:38:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-16 16:38:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-12-16 16:38:45,414 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 23 [2023-12-16 16:38:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:45,414 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-12-16 16:38:45,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-12-16 16:38:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 16:38:45,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:45,416 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:38:45,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:45,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:45,619 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:45,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1174071719, now seen corresponding path program 3 times [2023-12-16 16:38:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:45,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206632743] [2023-12-16 16:38:45,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:38:45,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:45,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:45,620 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:45,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:38:45,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 16:38:45,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:45,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:38:45,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-16 16:38:45,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-16 16:38:45,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:45,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206632743] [2023-12-16 16:38:45,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206632743] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:45,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:45,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 16:38:45,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663958683] [2023-12-16 16:38:45,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:45,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:38:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:38:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:38:45,746 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:45,796 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2023-12-16 16:38:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:38:45,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 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 25 [2023-12-16 16:38:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:45,799 INFO L225 Difference]: With dead ends: 92 [2023-12-16 16:38:45,799 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 16:38:45,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:38:45,801 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:45,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 71 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 16:38:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-16 16:38:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 88 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2023-12-16 16:38:45,823 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 25 [2023-12-16 16:38:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:45,823 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2023-12-16 16:38:45,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2023-12-16 16:38:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-16 16:38:45,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:45,827 INFO L195 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:38:45,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:46,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:46,029 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:46,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -535549999, now seen corresponding path program 4 times [2023-12-16 16:38:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:46,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585960905] [2023-12-16 16:38:46,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:38:46,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:46,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:46,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:46,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 16:38:46,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:38:46,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:46,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:38:46,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 187 proven. 1 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2023-12-16 16:38:46,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 187 proven. 1 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2023-12-16 16:38:46,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:46,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585960905] [2023-12-16 16:38:46,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585960905] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:46,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:46,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 16:38:46,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433026574] [2023-12-16 16:38:46,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:46,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:38:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:46,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:38:46,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:38:46,166 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:46,251 INFO L93 Difference]: Finished difference Result 283 states and 347 transitions. [2023-12-16 16:38:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:38:46,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 88 [2023-12-16 16:38:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:46,252 INFO L225 Difference]: With dead ends: 283 [2023-12-16 16:38:46,253 INFO L226 Difference]: Without dead ends: 197 [2023-12-16 16:38:46,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:38:46,254 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:46,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-16 16:38:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2023-12-16 16:38:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.1683673469387754) internal successors, (229), 196 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2023-12-16 16:38:46,292 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 88 [2023-12-16 16:38:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:46,297 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2023-12-16 16:38:46,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2023-12-16 16:38:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-12-16 16:38:46,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:46,302 INFO L195 NwaCegarLoop]: trace histogram [96, 16, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:38:46,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:46,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:46,502 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:46,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash 546566577, now seen corresponding path program 5 times [2023-12-16 16:38:46,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:46,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896802674] [2023-12-16 16:38:46,503 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 16:38:46,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:46,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:46,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:46,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 16:38:46,596 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2023-12-16 16:38:46,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:46,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:38:46,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6644 backedges. 4209 proven. 1 refuted. 0 times theorem prover too weak. 2434 trivial. 0 not checked. [2023-12-16 16:38:46,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6644 backedges. 4209 proven. 1 refuted. 0 times theorem prover too weak. 2434 trivial. 0 not checked. [2023-12-16 16:38:46,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896802674] [2023-12-16 16:38:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896802674] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:46,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:46,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 16:38:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118024052] [2023-12-16 16:38:46,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:46,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:38:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:46,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:38:46,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:38:46,765 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-16 16:38:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:46,871 INFO L93 Difference]: Finished difference Result 886 states and 1038 transitions. [2023-12-16 16:38:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:38:46,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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) Word has length 196 [2023-12-16 16:38:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:46,873 INFO L225 Difference]: With dead ends: 886 [2023-12-16 16:38:46,873 INFO L226 Difference]: Without dead ends: 737 [2023-12-16 16:38:46,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:38:46,875 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 48 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:46,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 65 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2023-12-16 16:38:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2023-12-16 16:38:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.158967391304348) internal successors, (853), 736 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 853 transitions. [2023-12-16 16:38:46,967 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 853 transitions. Word has length 196 [2023-12-16 16:38:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:46,967 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 853 transitions. [2023-12-16 16:38:46,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-16 16:38:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 853 transitions. [2023-12-16 16:38:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2023-12-16 16:38:46,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:46,976 INFO L195 NwaCegarLoop]: trace histogram [384, 64, 64, 64, 16, 16, 16, 16, 16, 16, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:38:46,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:47,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:47,179 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:47,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1996391215, now seen corresponding path program 6 times [2023-12-16 16:38:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071685842] [2023-12-16 16:38:47,180 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 16:38:47,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:47,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:47,181 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:47,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 16:38:47,379 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2023-12-16 16:38:47,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:47,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:38:47,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 106862 backedges. 42692 proven. 1 refuted. 0 times theorem prover too weak. 64169 trivial. 0 not checked. [2023-12-16 16:38:47,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 106862 backedges. 42692 proven. 1 refuted. 0 times theorem prover too weak. 64169 trivial. 0 not checked. [2023-12-16 16:38:47,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:47,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071685842] [2023-12-16 16:38:47,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071685842] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:47,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:47,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 16:38:47,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185449660] [2023-12-16 16:38:47,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:47,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:38:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:47,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:38:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:38:47,557 INFO L87 Difference]: Start difference. First operand 737 states and 853 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:47,912 INFO L93 Difference]: Finished difference Result 3444 states and 4005 transitions. [2023-12-16 16:38:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:38:47,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 736 [2023-12-16 16:38:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:47,921 INFO L225 Difference]: With dead ends: 3444 [2023-12-16 16:38:47,921 INFO L226 Difference]: Without dead ends: 2753 [2023-12-16 16:38:47,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1471 GetRequests, 1466 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:38:47,925 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:47,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 62 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2023-12-16 16:38:48,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2753. [2023-12-16 16:38:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2752 states have (on average 1.1471656976744187) internal successors, (3157), 2752 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3157 transitions. [2023-12-16 16:38:48,225 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3157 transitions. Word has length 736 [2023-12-16 16:38:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:48,225 INFO L495 AbstractCegarLoop]: Abstraction has 2753 states and 3157 transitions. [2023-12-16 16:38:48,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3157 transitions. [2023-12-16 16:38:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2753 [2023-12-16 16:38:48,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:48,358 INFO L195 NwaCegarLoop]: trace histogram [1536, 256, 256, 256, 64, 64, 64, 64, 64, 64, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:38:48,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 16:38:48,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:48,562 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:48,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1319345967, now seen corresponding path program 7 times [2023-12-16 16:38:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:48,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078608139] [2023-12-16 16:38:48,565 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-16 16:38:48,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:48,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:48,566 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:48,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 16:38:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:38:50,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 4709 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:38:50,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1704062 backedges. 52204 proven. 310 refuted. 0 times theorem prover too weak. 1651548 trivial. 0 not checked. [2023-12-16 16:38:50,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1704062 backedges. 52204 proven. 310 refuted. 0 times theorem prover too weak. 1651548 trivial. 0 not checked. [2023-12-16 16:38:50,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:50,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078608139] [2023-12-16 16:38:50,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078608139] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:50,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:50,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:38:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183536492] [2023-12-16 16:38:50,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:50,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:38:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:38:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:50,567 INFO L87 Difference]: Start difference. First operand 2753 states and 3157 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:50,920 INFO L93 Difference]: Finished difference Result 6653 states and 7717 transitions. [2023-12-16 16:38:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:38:50,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2752 [2023-12-16 16:38:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:50,931 INFO L225 Difference]: With dead ends: 6653 [2023-12-16 16:38:50,931 INFO L226 Difference]: Without dead ends: 3905 [2023-12-16 16:38:50,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5502 GetRequests, 5492 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:38:50,936 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:50,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2023-12-16 16:38:51,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3905. [2023-12-16 16:38:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3905 states, 3904 states have (on average 1.1365266393442623) internal successors, (4437), 3904 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 4437 transitions. [2023-12-16 16:38:51,265 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 4437 transitions. Word has length 2752 [2023-12-16 16:38:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:51,265 INFO L495 AbstractCegarLoop]: Abstraction has 3905 states and 4437 transitions. [2023-12-16 16:38:51,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 4437 transitions. [2023-12-16 16:38:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3905 [2023-12-16 16:38:51,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:51,359 INFO L195 NwaCegarLoop]: trace histogram [2304, 384, 384, 384, 64, 64, 64, 64, 64, 64, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:38:51,407 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-16 16:38:51,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:51,572 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:51,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1662603473, now seen corresponding path program 8 times [2023-12-16 16:38:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075141561] [2023-12-16 16:38:51,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:38:51,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:51,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:51,577 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:51,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-16 16:38:53,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:38:53,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:38:53,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 6757 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:38:53,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:38:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3800638 backedges. 116904 proven. 1 refuted. 0 times theorem prover too weak. 3683733 trivial. 0 not checked. [2023-12-16 16:38:54,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:38:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3800638 backedges. 116904 proven. 1 refuted. 0 times theorem prover too weak. 3683733 trivial. 0 not checked. [2023-12-16 16:38:54,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:38:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075141561] [2023-12-16 16:38:54,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075141561] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:38:54,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:38:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 16:38:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097971135] [2023-12-16 16:38:54,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:38:54,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:38:54,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:38:54,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:38:54,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:38:54,363 INFO L87 Difference]: Start difference. First operand 3905 states and 4437 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:38:55,594 INFO L93 Difference]: Finished difference Result 18692 states and 21284 transitions. [2023-12-16 16:38:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:38:55,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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) Word has length 3904 [2023-12-16 16:38:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:38:55,638 INFO L225 Difference]: With dead ends: 18692 [2023-12-16 16:38:55,638 INFO L226 Difference]: Without dead ends: 14849 [2023-12-16 16:38:55,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7807 GetRequests, 7802 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:38:55,647 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:38:55,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 50 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:38:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14849 states. [2023-12-16 16:38:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14849 to 14849. [2023-12-16 16:38:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14849 states, 14848 states have (on average 1.1264143318965518) internal successors, (16725), 14848 states have internal predecessors, (16725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14849 states to 14849 states and 16725 transitions. [2023-12-16 16:38:56,979 INFO L78 Accepts]: Start accepts. Automaton has 14849 states and 16725 transitions. Word has length 3904 [2023-12-16 16:38:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:38:56,979 INFO L495 AbstractCegarLoop]: Abstraction has 14849 states and 16725 transitions. [2023-12-16 16:38:56,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:38:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 14849 states and 16725 transitions. [2023-12-16 16:38:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14849 [2023-12-16 16:38:58,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:38:58,218 INFO L195 NwaCegarLoop]: trace histogram [9216, 1536, 1536, 1536, 256, 256, 256, 64, 64, 64, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:38:58,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-16 16:38:58,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:38:58,419 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:38:58,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:38:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1221277905, now seen corresponding path program 9 times [2023-12-16 16:38:58,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:38:58,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304500852] [2023-12-16 16:38:58,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:38:58,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-16 16:38:58,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:38:58,432 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:38:58,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-16 16:39:01,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 91 check-sat command(s) [2023-12-16 16:39:01,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:39:01,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:39:02,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:39:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 60670174 backedges. 1866558 proven. 11110 refuted. 0 times theorem prover too weak. 58792506 trivial. 0 not checked. [2023-12-16 16:39:03,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:39:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 60670174 backedges. 1866558 proven. 11110 refuted. 0 times theorem prover too weak. 58792506 trivial. 0 not checked. [2023-12-16 16:39:06,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:39:06,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304500852] [2023-12-16 16:39:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304500852] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:39:06,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:39:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2023-12-16 16:39:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998898932] [2023-12-16 16:39:06,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:39:06,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 16:39:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:39:06,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 16:39:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-12-16 16:39:06,020 INFO L87 Difference]: Start difference. First operand 14849 states and 16725 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:39:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:39:09,459 INFO L93 Difference]: Finished difference Result 51353 states and 58148 transitions. [2023-12-16 16:39:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 16:39:09,460 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 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 14848 [2023-12-16 16:39:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:39:09,529 INFO L225 Difference]: With dead ends: 51353 [2023-12-16 16:39:09,529 INFO L226 Difference]: Without dead ends: 36737 [2023-12-16 16:39:09,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29701 GetRequests, 29684 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2023-12-16 16:39:09,557 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 78 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:39:09,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 141 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:39:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36737 states. [2023-12-16 16:39:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36737 to 36737. [2023-12-16 16:39:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36737 states, 36736 states have (on average 1.1260071864111498) internal successors, (41365), 36736 states have internal predecessors, (41365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:39:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36737 states to 36737 states and 41365 transitions. [2023-12-16 16:39:12,840 INFO L78 Accepts]: Start accepts. Automaton has 36737 states and 41365 transitions. Word has length 14848 [2023-12-16 16:39:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:39:12,842 INFO L495 AbstractCegarLoop]: Abstraction has 36737 states and 41365 transitions. [2023-12-16 16:39:12,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:39:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 36737 states and 41365 transitions. [2023-12-16 16:39:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22145 [2023-12-16 16:39:15,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:39:15,628 INFO L195 NwaCegarLoop]: trace histogram [13824, 2304, 2304, 2304, 384, 384, 384, 64, 64, 64, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1] [2023-12-16 16:39:15,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-16 16:39:15,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:39:15,829 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:39:15,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:39:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1200957649, now seen corresponding path program 10 times [2023-12-16 16:39:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:39:15,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245900303] [2023-12-16 16:39:15,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:39:15,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:39:15,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:39:15,847 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:39:15,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process Received shutdown request... [2023-12-16 16:39:57,440 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 (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:39:57,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:39:58,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-16 16:39:58,641 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forcibly destroying the process [2023-12-16 16:39:58,795 ERROR L246 FreeRefinementEngine]: Caught known exception: Timeout or Toolchain cancelled by user [2023-12-16 16:39:58,801 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:39:58,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:39:58,801 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 22145 with TraceHistMax 13824,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [245900303] and IpTcStrategyModuleCvc4 [221402051]. [2023-12-16 16:39:58,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 137 [2023-12-16 16:39:58,805 INFO L445 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1, 1, 1] [2023-12-16 16:39:58,807 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:39:58,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:39:58 BoogieIcfgContainer [2023-12-16 16:39:58,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:39:58,810 INFO L158 Benchmark]: Toolchain (without parser) took 76242.33ms. Allocated memory was 285.2MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 240.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-16 16:39:58,810 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 221.2MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:39:58,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.05ms. Allocated memory is still 285.2MB. Free memory was 240.2MB in the beginning and 228.9MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:39:58,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.00ms. Allocated memory is still 285.2MB. Free memory was 228.9MB in the beginning and 227.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 16:39:58,811 INFO L158 Benchmark]: Boogie Preprocessor took 21.91ms. Allocated memory is still 285.2MB. Free memory was 227.3MB in the beginning and 225.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:39:58,811 INFO L158 Benchmark]: RCFGBuilder took 248.72ms. Allocated memory is still 285.2MB. Free memory was 225.5MB in the beginning and 212.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 16:39:58,811 INFO L158 Benchmark]: TraceAbstraction took 75786.96ms. Allocated memory was 285.2MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 212.1MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-16 16:39:58,812 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.21ms. Allocated memory is still 221.2MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 156.05ms. Allocated memory is still 285.2MB. Free memory was 240.2MB in the beginning and 228.9MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.00ms. Allocated memory is still 285.2MB. Free memory was 228.9MB in the beginning and 227.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.91ms. Allocated memory is still 285.2MB. Free memory was 227.3MB in the beginning and 225.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 248.72ms. Allocated memory is still 285.2MB. Free memory was 225.5MB in the beginning and 212.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 75786.96ms. Allocated memory was 285.2MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 212.1MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. 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: 37]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 37). Cancelled while NwaCegarLoop was analyzing trace of length 22145 with TraceHistMax 13824,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [245900303] and IpTcStrategyModuleCvc4 [221402051]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.7s, OverallIterations: 16, TraceHistogramMax: 13824, PathProgramHistogramMax: 10, EmptinessCheckTime: 4.3s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 912 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 612 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 430 IncrementalHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 300 mSDtfsCounter, 430 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45242 GetRequests, 45169 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36737occurred in iteration=15, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.0s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 22661 NumberOfCodeBlocks, 7345 NumberOfCodeBlocksAsserted, 147 NumberOfCheckSat, 45229 ConstructedInterpolants, 0 QuantifiedInterpolants, 49137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 12770 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 132555057/132577929 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