/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:01:09,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:01:09,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 22:01:09,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:01:09,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:01:09,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:01:09,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:01:09,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:01:09,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:01:09,324 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:01:09,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:01:09,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:01:09,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:01:09,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:01:09,326 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:01:09,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:01:09,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:01:09,327 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:01:09,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:01:09,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:01:09,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:01:09,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:01:09,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:01:09,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:01:09,330 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:01:09,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:01:09,330 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:01:09,331 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:01:09,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:01:09,331 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:01:09,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:01:09,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:01:09,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:01:09,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:01:09,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:01:09,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:01:09,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:01:09,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:01:09,333 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:01:09,333 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:01:09,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:01:09,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:01:09,334 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:01:09,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:01:09,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:01:09,335 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:01:09,335 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 22:01:09,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:01:09,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:01:09,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:01:09,587 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:01:09,588 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:01:09,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2023-12-24 22:01:10,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:01:10,885 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:01:10,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2023-12-24 22:01:10,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfa748e94/d3972d46c21648b585b4f311d431f340/FLAGe58abb7af [2023-12-24 22:01:10,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfa748e94/d3972d46c21648b585b4f311d431f340 [2023-12-24 22:01:10,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:01:10,913 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:01:10,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:01:10,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:01:10,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:01:10,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:01:10" (1/1) ... [2023-12-24 22:01:10,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0f7bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:10, skipping insertion in model container [2023-12-24 22:01:10,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:01:10" (1/1) ... [2023-12-24 22:01:10,945 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:01:11,088 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2023-12-24 22:01:11,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:01:11,129 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:01:11,139 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2023-12-24 22:01:11,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:01:11,160 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:01:11,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11 WrapperNode [2023-12-24 22:01:11,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:01:11,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:01:11,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:01:11,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:01:11,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,193 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2023-12-24 22:01:11,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:01:11,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:01:11,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:01:11,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:01:11,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,219 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 3 writes are split as follows [0, 2, 1]. [2023-12-24 22:01:11,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:01:11,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:01:11,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:01:11,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:01:11,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (1/1) ... [2023-12-24 22:01:11,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:01:11,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:01:11,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 22:01:11,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 22:01:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:01:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:01:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 22:01:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 22:01:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 22:01:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 22:01:11,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 22:01:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 22:01:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 22:01:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 22:01:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 22:01:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:01:11,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:01:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 22:01:11,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 22:01:11,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 22:01:11,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 22:01:11,375 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:01:11,376 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:01:11,558 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:01:11,616 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:01:11,616 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-24 22:01:11,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:01:11 BoogieIcfgContainer [2023-12-24 22:01:11,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:01:11,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:01:11,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:01:11,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:01:11,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:01:10" (1/3) ... [2023-12-24 22:01:11,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c15f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:01:11, skipping insertion in model container [2023-12-24 22:01:11,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:01:11" (2/3) ... [2023-12-24 22:01:11,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c15f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:01:11, skipping insertion in model container [2023-12-24 22:01:11,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:01:11" (3/3) ... [2023-12-24 22:01:11,624 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2023-12-24 22:01:11,640 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:01:11,640 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:01:11,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:01:11,686 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;@2e8e005b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:01:11,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:01:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 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-24 22:01:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 22:01:11,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:11,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:11,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:11,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash -831585943, now seen corresponding path program 1 times [2023-12-24 22:01:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:11,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730854085] [2023-12-24 22:01:11,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:01:11,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:11,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:11,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:11,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 22:01:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:01:11,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 22:01:11,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:01:11,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:01:11,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:11,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730854085] [2023-12-24 22:01:11,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730854085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:01:11,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:01:11,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 22:01:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117013629] [2023-12-24 22:01:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:01:11,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 22:01:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:11,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 22:01:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:01:11,870 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:11,923 INFO L93 Difference]: Finished difference Result 31 states and 49 transitions. [2023-12-24 22:01:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 22:01:11,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-24 22:01:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:11,930 INFO L225 Difference]: With dead ends: 31 [2023-12-24 22:01:11,930 INFO L226 Difference]: Without dead ends: 15 [2023-12-24 22:01:11,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-24 22:01:11,936 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:11,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:01:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-24 22:01:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-24 22:01:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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-24 22:01:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2023-12-24 22:01:11,959 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2023-12-24 22:01:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:11,959 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-12-24 22:01:11,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2023-12-24 22:01:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 22:01:11,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:11,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:11,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 22:01:12,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:12,163 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:12,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1273734631, now seen corresponding path program 1 times [2023-12-24 22:01:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619869240] [2023-12-24 22:01:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:01:12,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:12,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:12,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 22:01:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:01:12,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 22:01:12,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:01:12,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:01:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:01:12,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619869240] [2023-12-24 22:01:12,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619869240] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:01:12,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:01:12,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 22:01:12,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84977839] [2023-12-24 22:01:12,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:01:12,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 22:01:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:12,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 22:01:12,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:01:12,282 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:12,371 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-12-24 22:01:12,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 22:01:12,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 22:01:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:12,372 INFO L225 Difference]: With dead ends: 40 [2023-12-24 22:01:12,373 INFO L226 Difference]: Without dead ends: 28 [2023-12-24 22:01:12,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-24 22:01:12,374 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:12,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:01:12,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-24 22:01:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2023-12-24 22:01:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-24 22:01:12,379 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2023-12-24 22:01:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:12,379 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-24 22:01:12,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-24 22:01:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 22:01:12,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:12,380 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:12,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 22:01:12,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:12,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:12,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1185436311, now seen corresponding path program 2 times [2023-12-24 22:01:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:12,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137096983] [2023-12-24 22:01:12,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:01:12,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:12,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:12,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:12,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 22:01:12,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-24 22:01:12,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:01:12,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 22:01:12,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-24 22:01:12,683 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:01:12,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:12,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137096983] [2023-12-24 22:01:12,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137096983] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:01:12,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:01:12,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 22:01:12,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886408170] [2023-12-24 22:01:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:01:12,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 22:01:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 22:01:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:01:12,690 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:12,745 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2023-12-24 22:01:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 22:01:12,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-24 22:01:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:12,748 INFO L225 Difference]: With dead ends: 29 [2023-12-24 22:01:12,748 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 22:01:12,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:01:12,751 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:12,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:01:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 22:01:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2023-12-24 22:01:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-24 22:01:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-24 22:01:12,764 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2023-12-24 22:01:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:12,764 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-24 22:01:12,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-24 22:01:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 22:01:12,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:12,765 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:12,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 22:01:12,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:12,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:12,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1895147126, now seen corresponding path program 1 times [2023-12-24 22:01:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601874665] [2023-12-24 22:01:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:01:12,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:12,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:12,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:12,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 22:01:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:01:13,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 22:01:13,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:01:13,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:01:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:01:13,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:13,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601874665] [2023-12-24 22:01:13,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601874665] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:01:13,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:01:13,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 22:01:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324679848] [2023-12-24 22:01:13,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:01:13,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 22:01:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 22:01:13,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:01:13,191 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:13,374 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-12-24 22:01:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 22:01:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-24 22:01:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:13,375 INFO L225 Difference]: With dead ends: 54 [2023-12-24 22:01:13,375 INFO L226 Difference]: Without dead ends: 41 [2023-12-24 22:01:13,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:01:13,376 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:13,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 136 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:01:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-24 22:01:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 20. [2023-12-24 22:01:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-24 22:01:13,382 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 15 [2023-12-24 22:01:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:13,382 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-24 22:01:13,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-24 22:01:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-24 22:01:13,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:13,383 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:13,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 22:01:13,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:13,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:13,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash -939468070, now seen corresponding path program 2 times [2023-12-24 22:01:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:13,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320872701] [2023-12-24 22:01:13,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:01:13,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:13,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:13,590 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:13,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 22:01:13,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:01:13,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:01:13,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 22:01:13,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:01:13,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:01:13,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:13,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320872701] [2023-12-24 22:01:13,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320872701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:01:13,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:01:13,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 22:01:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838087662] [2023-12-24 22:01:13,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:01:13,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 22:01:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:13,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 22:01:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:01:13,711 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:13,783 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-24 22:01:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 22:01:13,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-24 22:01:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:13,789 INFO L225 Difference]: With dead ends: 38 [2023-12-24 22:01:13,790 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 22:01:13,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:01:13,791 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:13,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 22 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:01:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 22:01:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2023-12-24 22:01:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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-24 22:01:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-24 22:01:13,799 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2023-12-24 22:01:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:13,799 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-24 22:01:13,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-24 22:01:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 22:01:13,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:13,800 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:13,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 22:01:14,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:14,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:14,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash -631693928, now seen corresponding path program 1 times [2023-12-24 22:01:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:14,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991831718] [2023-12-24 22:01:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:01:14,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:14,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:14,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:14,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 22:01:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:01:14,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:01:14,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:01:14,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:01:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:01:14,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:14,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991831718] [2023-12-24 22:01:14,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991831718] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:01:14,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:01:14,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-24 22:01:14,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242706486] [2023-12-24 22:01:14,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:01:14,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 22:01:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:14,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 22:01:14,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-24 22:01:14,201 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-24 22:01:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:14,440 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2023-12-24 22:01:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 22:01:14,441 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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) Word has length 19 [2023-12-24 22:01:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:14,442 INFO L225 Difference]: With dead ends: 55 [2023-12-24 22:01:14,442 INFO L226 Difference]: Without dead ends: 44 [2023-12-24 22:01:14,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2023-12-24 22:01:14,443 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 112 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:14,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 34 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:01:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-24 22:01:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2023-12-24 22:01:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-12-24 22:01:14,452 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 19 [2023-12-24 22:01:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:14,453 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-12-24 22:01:14,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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-24 22:01:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2023-12-24 22:01:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-24 22:01:14,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:14,454 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:14,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 22:01:14,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:14,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:14,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:14,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2077578918, now seen corresponding path program 2 times [2023-12-24 22:01:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:14,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879728493] [2023-12-24 22:01:14,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:01:14,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:14,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:14,657 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:14,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 22:01:14,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:01:14,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:01:14,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 22:01:14,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-24 22:01:14,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:01:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-24 22:01:14,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879728493] [2023-12-24 22:01:14,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879728493] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:01:14,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:01:14,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 22:01:14,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789291767] [2023-12-24 22:01:14,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:01:14,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 22:01:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:14,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 22:01:14,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 22:01:14,928 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:15,032 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2023-12-24 22:01:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 22:01:15,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-24 22:01:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:15,037 INFO L225 Difference]: With dead ends: 55 [2023-12-24 22:01:15,037 INFO L226 Difference]: Without dead ends: 49 [2023-12-24 22:01:15,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-24 22:01:15,038 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:15,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 37 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:01:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-24 22:01:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-24 22:01:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2023-12-24 22:01:15,050 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 28 [2023-12-24 22:01:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:15,052 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2023-12-24 22:01:15,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2023-12-24 22:01:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-24 22:01:15,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:15,054 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:15,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 22:01:15,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:15,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:15,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2075651161, now seen corresponding path program 3 times [2023-12-24 22:01:15,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:15,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19739900] [2023-12-24 22:01:15,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:01:15,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:15,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:15,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:15,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 22:01:15,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-24 22:01:15,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:01:15,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 22:01:15,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:15,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 22:01:16,009 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:01:16,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:01:16,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2023-12-24 22:01:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-12-24 22:01:16,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:01:16,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:16,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19739900] [2023-12-24 22:01:16,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19739900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:01:16,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:01:16,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 22:01:16,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864522032] [2023-12-24 22:01:16,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:01:16,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 22:01:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 22:01:16,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:01:16,036 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-24 22:01:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:16,169 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2023-12-24 22:01:16,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 22:01:16,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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 43 [2023-12-24 22:01:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:16,170 INFO L225 Difference]: With dead ends: 54 [2023-12-24 22:01:16,170 INFO L226 Difference]: Without dead ends: 52 [2023-12-24 22:01:16,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-24 22:01:16,171 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:16,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 34 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:01:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-24 22:01:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-12-24 22:01:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2023-12-24 22:01:16,188 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 43 [2023-12-24 22:01:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:16,188 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2023-12-24 22:01:16,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-24 22:01:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2023-12-24 22:01:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-24 22:01:16,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:16,189 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:16,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 22:01:16,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:16,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:16,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1084846963, now seen corresponding path program 1 times [2023-12-24 22:01:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:16,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969029898] [2023-12-24 22:01:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:01:16,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:16,394 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:16,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 22:01:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:01:16,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:01:16,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 25 proven. 37 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-24 22:01:16,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:01:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 25 proven. 37 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-24 22:01:16,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:16,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969029898] [2023-12-24 22:01:16,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969029898] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:01:16,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:01:16,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-24 22:01:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021406577] [2023-12-24 22:01:16,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:01:16,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 22:01:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 22:01:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:01:16,848 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:17,157 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2023-12-24 22:01:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 22:01:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-24 22:01:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:17,158 INFO L225 Difference]: With dead ends: 76 [2023-12-24 22:01:17,158 INFO L226 Difference]: Without dead ends: 56 [2023-12-24 22:01:17,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2023-12-24 22:01:17,159 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 76 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:17,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 68 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 22:01:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-24 22:01:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-12-24 22:01:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2023-12-24 22:01:17,181 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 46 [2023-12-24 22:01:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:17,181 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2023-12-24 22:01:17,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2023-12-24 22:01:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-24 22:01:17,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:17,187 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:17,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 22:01:17,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:17,393 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:17,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash 339334995, now seen corresponding path program 2 times [2023-12-24 22:01:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:17,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004776688] [2023-12-24 22:01:17,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:01:17,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:17,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:17,395 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:17,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 22:01:17,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:01:17,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:01:17,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 22:01:17,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 20 proven. 57 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-24 22:01:17,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:01:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 20 proven. 57 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-24 22:01:17,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:17,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004776688] [2023-12-24 22:01:17,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004776688] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:01:17,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:01:17,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 22:01:17,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683297548] [2023-12-24 22:01:17,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:01:17,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 22:01:17,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:17,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 22:01:17,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:01:17,878 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:18,128 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2023-12-24 22:01:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 22:01:18,128 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-24 22:01:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:18,129 INFO L225 Difference]: With dead ends: 78 [2023-12-24 22:01:18,129 INFO L226 Difference]: Without dead ends: 63 [2023-12-24 22:01:18,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2023-12-24 22:01:18,130 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 78 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:18,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 40 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:01:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-24 22:01:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2023-12-24 22:01:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2023-12-24 22:01:18,151 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 49 [2023-12-24 22:01:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:18,153 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2023-12-24 22:01:18,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2023-12-24 22:01:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-24 22:01:18,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:18,154 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:18,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 22:01:18,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:18,360 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:18,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1752165133, now seen corresponding path program 3 times [2023-12-24 22:01:18,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:18,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67051057] [2023-12-24 22:01:18,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:01:18,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:18,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:18,363 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:18,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 22:01:18,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 22:01:18,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:01:18,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 22:01:18,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:18,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 22:01:18,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-24 22:01:19,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:01:19,719 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:01:19,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:01:19,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 30 [2023-12-24 22:01:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-12-24 22:01:19,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:01:20,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-12-24 22:01:20,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2023-12-24 22:01:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-12-24 22:01:20,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:20,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67051057] [2023-12-24 22:01:20,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67051057] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:01:20,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:01:20,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-24 22:01:20,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834821043] [2023-12-24 22:01:20,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:01:20,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 22:01:20,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:20,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 22:01:20,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-24 22:01:20,630 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:20,977 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2023-12-24 22:01:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 22:01:20,977 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 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 58 [2023-12-24 22:01:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:20,978 INFO L225 Difference]: With dead ends: 65 [2023-12-24 22:01:20,978 INFO L226 Difference]: Without dead ends: 63 [2023-12-24 22:01:20,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2023-12-24 22:01:20,979 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:20,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 52 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:01:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-24 22:01:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2023-12-24 22:01:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2023-12-24 22:01:20,999 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 58 [2023-12-24 22:01:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:20,999 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2023-12-24 22:01:20,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2023-12-24 22:01:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-24 22:01:21,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:21,000 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:21,007 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-24 22:01:21,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:21,204 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:21,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2008658791, now seen corresponding path program 4 times [2023-12-24 22:01:21,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:21,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711918596] [2023-12-24 22:01:21,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:01:21,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:21,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:21,206 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:21,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 22:01:21,380 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:01:21,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:01:21,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:01:21,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-24 22:01:21,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:01:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-24 22:01:21,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:01:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711918596] [2023-12-24 22:01:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711918596] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:01:21,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:01:21,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-24 22:01:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458115970] [2023-12-24 22:01:21,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:01:21,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 22:01:21,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:01:21,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 22:01:21,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:01:21,761 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:01:21,951 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2023-12-24 22:01:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 22:01:21,952 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-24 22:01:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:01:21,953 INFO L225 Difference]: With dead ends: 82 [2023-12-24 22:01:21,953 INFO L226 Difference]: Without dead ends: 71 [2023-12-24 22:01:21,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-24 22:01:21,954 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 71 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:01:21,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 119 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 22:01:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-24 22:01:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2023-12-24 22:01:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 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-24 22:01:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2023-12-24 22:01:21,992 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 61 [2023-12-24 22:01:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:01:21,992 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2023-12-24 22:01:21,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:01:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2023-12-24 22:01:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-24 22:01:21,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:01:21,993 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:01:22,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 22:01:22,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:22,199 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:01:22,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:01:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash -985173222, now seen corresponding path program 5 times [2023-12-24 22:01:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:01:22,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464347732] [2023-12-24 22:01:22,200 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-24 22:01:22,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:01:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:01:22,201 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:01:22,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 22:01:22,466 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-12-24 22:01:22,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:01:22,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 22:01:22,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:01:22,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 22:01:23,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:01:23,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 42 [2023-12-24 22:01:23,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:01:23,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 13 [2023-12-24 22:01:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 153 proven. 31 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-24 22:01:23,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:03:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 160 proven. 24 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-24 22:03:03,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:03:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464347732] [2023-12-24 22:03:03,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464347732] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:03:03,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:03:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2023-12-24 22:03:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245048704] [2023-12-24 22:03:03,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:03:03,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-24 22:03:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:03:03,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-24 22:03:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=745, Unknown=21, NotChecked=0, Total=870 [2023-12-24 22:03:03,527 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 30 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:03:07,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:03:11,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:03:44,150 WARN L293 SmtUtils]: Spent 24.05s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:03:48,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:03:52,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:03:56,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:04:56,936 WARN L293 SmtUtils]: Spent 48.12s on a formula simplification. DAG size of input: 55 DAG size of output: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:04:58,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:04:59,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:05:03,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:05:07,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:06:03,914 WARN L293 SmtUtils]: Spent 48.09s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:06:07,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:06:11,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:06:44,688 WARN L293 SmtUtils]: Spent 24.07s on a formula simplification. DAG size of input: 48 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:06:48,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:06:52,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:06:56,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:07:29,134 WARN L293 SmtUtils]: Spent 20.06s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:07:33,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:07:37,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:07:48,072 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 34 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:08:01,724 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 60 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:08:05,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:09,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:13,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:17,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:21,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:25,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:54,535 WARN L293 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:09:42,535 WARN L293 SmtUtils]: Spent 40.16s on a formula simplification. DAG size of input: 56 DAG size of output: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:09:50,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:54,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:10:38,726 WARN L293 SmtUtils]: Spent 36.18s on a formula simplification. DAG size of input: 61 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:10:42,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:46,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:43,485 WARN L293 SmtUtils]: Spent 40.17s on a formula simplification. DAG size of input: 56 DAG size of output: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:11:47,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:41,610 WARN L293 SmtUtils]: Spent 41.79s on a formula simplification. DAG size of input: 70 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:12:45,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:49,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:53,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:13:58,332 WARN L293 SmtUtils]: Spent 40.14s on a formula simplification. DAG size of input: 63 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:14:19,096 WARN L293 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:14:23,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:27,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:31,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:35,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:39,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:43,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:47,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:51,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:55,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:59,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:15:03,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:07,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:11,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:15,268 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul (_ bv4 32) |c_ULTIMATE.start_SelectionSort_~rh~0#1|)) (.cse10 (bvmul |c_ULTIMATE.start_SelectionSort_~i~0#1| (_ bv4 32))) (.cse3 (select |c_#memory_int#1| |c_~#array~0.base|)) (.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_SelectionSort_~lh~0#1|))) (let ((.cse2 (select .cse3 (bvadd .cse4 |c_~#array~0.offset|))) (.cse1 (select .cse3 (bvadd |c_~#array~0.offset| .cse10))) (.cse0 (select .cse3 (bvadd (_ bv4 32) |c_~#array~0.offset| .cse10))) (.cse6 (select .cse3 (bvadd |c_~#array~0.offset| .cse5)))) (and (= |c_ULTIMATE.start_SelectionSort_~rh~0#1| |c_ULTIMATE.start_SelectionSort_~lh~0#1|) (or (not (bvslt .cse0 .cse1)) (not (bvslt |c_ULTIMATE.start_SelectionSort_#t~mem3#1| |c_ULTIMATE.start_SelectionSort_#t~mem4#1|))) (bvslt .cse2 (select .cse3 (bvadd .cse4 (_ bv8 32) |c_~#array~0.offset|))) (bvslt (select .cse3 (bvadd (_ bv4 32) |c_~#array~0.offset| .cse5)) .cse6) (bvslt .cse6 (select .cse3 (bvadd (_ bv8 32) |c_~#array~0.offset| .cse5))) (bvslt (select .cse3 (bvadd .cse4 (_ bv4 32) |c_~#array~0.offset|)) .cse2) (= |c_ULTIMATE.start_SelectionSort_~i~0#1| (bvadd |c_ULTIMATE.start_SelectionSort_~lh~0#1| (_ bv1 32))) (= |c_ULTIMATE.start_SelectionSort_~i~0#1| (bvadd |c_ULTIMATE.start_SelectionSort_~rh~0#1| (_ bv1 32))) (forall ((|~#array~0.offset| (_ BitVec 32))) (let ((.cse11 (select .cse3 (bvadd |~#array~0.offset| .cse10)))) (or (forall ((v_ArrVal_227 (_ BitVec 32))) (let ((.cse7 (let ((.cse9 (bvadd |~#array~0.offset| .cse4))) (store (store .cse3 .cse9 v_ArrVal_227) (bvadd |~#array~0.offset| (_ bv8 32) .cse10) (select .cse3 .cse9))))) (let ((.cse8 (select .cse7 (bvadd |~#array~0.offset| .cse4 (_ bv8 32))))) (or (not (bvslt (select .cse7 (bvadd |~#array~0.offset| .cse4 (_ bv12 32))) .cse8)) (not (bvslt .cse8 (select .cse7 (bvadd |~#array~0.offset| .cse4 (_ bv4 32))))))))) (not (bvslt .cse11 (select .cse3 (bvadd |~#array~0.offset| .cse5)))) (not (bvslt (select .cse3 (bvadd |~#array~0.offset| (_ bv4 32) .cse10)) .cse11))))) (not (bvslt .cse1 .cse6)) (not (bvslt .cse0 .cse6))))) is different from false [2023-12-24 22:15:19,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:23,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:48,118 WARN L293 SmtUtils]: Spent 16.10s on a formula simplification. DAG size of input: 44 DAG size of output: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 22:15:52,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-24 22:15:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 22:15:52,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 684.6s TimeCoverageRelationStatistics Valid=293, Invalid=1912, Unknown=55, NotChecked=92, Total=2352 [2023-12-24 22:15:52,704 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 15 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 184.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 184.8s IncrementalHoareTripleChecker+Time [2023-12-24 22:15:52,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 56 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 463 Invalid, 44 Unknown, 0 Unchecked, 184.8s Time] [2023-12-24 22:15:52,705 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:15:52,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 22:15:52,726 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 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 22:15:52,726 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-24 22:15:52,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:15:52,910 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (67states) and FLOYD_HOARE automaton (currently 26 states, 30 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. [2023-12-24 22:15:52,914 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1] [2023-12-24 22:15:52,916 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:15:52,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:15:52 BoogieIcfgContainer [2023-12-24 22:15:52,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:15:52,923 INFO L158 Benchmark]: Toolchain (without parser) took 882008.21ms. Allocated memory was 177.2MB in the beginning and 268.4MB in the end (delta: 91.2MB). Free memory was 128.8MB in the beginning and 224.5MB in the end (delta: -95.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:15:52,923 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:15:52,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.56ms. Allocated memory is still 177.2MB. Free memory was 128.4MB in the beginning and 116.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:15:52,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.46ms. Allocated memory is still 177.2MB. Free memory was 116.8MB in the beginning and 115.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:15:52,926 INFO L158 Benchmark]: Boogie Preprocessor took 48.59ms. Allocated memory is still 177.2MB. Free memory was 115.1MB in the beginning and 112.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:15:52,926 INFO L158 Benchmark]: RCFGBuilder took 374.11ms. Allocated memory is still 177.2MB. Free memory was 112.7MB in the beginning and 97.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 22:15:52,927 INFO L158 Benchmark]: TraceAbstraction took 881301.57ms. Allocated memory was 177.2MB in the beginning and 268.4MB in the end (delta: 91.2MB). Free memory was 97.0MB in the beginning and 224.5MB in the end (delta: -127.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:15:52,928 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.14ms. Allocated memory is still 177.2MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.56ms. Allocated memory is still 177.2MB. Free memory was 128.4MB in the beginning and 116.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.46ms. Allocated memory is still 177.2MB. Free memory was 116.8MB in the beginning and 115.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.59ms. Allocated memory is still 177.2MB. Free memory was 115.1MB in the beginning and 112.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 374.11ms. Allocated memory is still 177.2MB. Free memory was 112.7MB in the beginning and 97.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 881301.57ms. Allocated memory was 177.2MB in the beginning and 268.4MB in the end (delta: 91.2MB). Free memory was 97.0MB in the beginning and 224.5MB in the end (delta: -127.5MB). There was no memory consumed. 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: 16]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16). Cancelled while NwaCegarLoop was constructing difference of abstraction (67states) and FLOYD_HOARE automaton (currently 26 states, 30 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 881.2s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 771.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 44 mSolverCounterUnknown, 620 SdHoareTripleChecker+Valid, 185.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 620 mSDsluCounter, 708 SdHoareTripleChecker+Invalid, 185.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 539 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1277 IncrementalHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 169 mSDtfsCounter, 1277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 813 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 686.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=12, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 58 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 105.6s InterpolantComputationTime, 428 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 755 ConstructedInterpolants, 95 QuantifiedInterpolants, 7979 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1137 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 1504/2092 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