/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-crafted-1/mono-crafted_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 23:39:58,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 23:39:58,636 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 23:39:58,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 23:39:58,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 23:39:58,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 23:39:58,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 23:39:58,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 23:39:58,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 23:39:58,665 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 23:39:58,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 23:39:58,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 23:39:58,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 23:39:58,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 23:39:58,667 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 23:39:58,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 23:39:58,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 23:39:58,668 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 23:39:58,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 23:39:58,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 23:39:58,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 23:39:58,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 23:39:58,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 23:39:58,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 23:39:58,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 23:39:58,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 23:39:58,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 23:39:58,670 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 23:39:58,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 23:39:58,670 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 23:39:58,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 23:39:58,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 23:39:58,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 23:39:58,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 23:39:58,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:39:58,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 23:39:58,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 23:39:58,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 23:39:58,671 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 23:39:58,672 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 23:39:58,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 23:39:58,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 23:39:58,672 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 23:39:58,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 23:39:58,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 23:39:58,672 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 23:39:58,672 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 23:39:58,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 23:39:58,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 23:39:58,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 23:39:58,874 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 23:39:58,875 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 23:39:58,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_7.c [2023-12-24 23:39:59,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 23:40:00,062 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 23:40:00,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_7.c [2023-12-24 23:40:00,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cd9b569/fc17762db5bc4b2ab419475c917751a2/FLAGc32b75dcf [2023-12-24 23:40:00,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cd9b569/fc17762db5bc4b2ab419475c917751a2 [2023-12-24 23:40:00,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 23:40:00,082 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 23:40:00,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 23:40:00,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 23:40:00,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 23:40:00,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9544f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00, skipping insertion in model container [2023-12-24 23:40:00,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,103 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 23:40:00,219 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-crafted-1/mono-crafted_7.c[318,331] [2023-12-24 23:40:00,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:40:00,240 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 23:40:00,249 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-crafted-1/mono-crafted_7.c[318,331] [2023-12-24 23:40:00,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:40:00,263 INFO L206 MainTranslator]: Completed translation [2023-12-24 23:40:00,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00 WrapperNode [2023-12-24 23:40:00,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 23:40:00,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 23:40:00,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 23:40:00,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 23:40:00,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,288 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2023-12-24 23:40:00,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 23:40:00,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 23:40:00,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 23:40:00,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 23:40:00,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,318 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 23:40:00,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 23:40:00,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 23:40:00,326 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 23:40:00,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 23:40:00,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (1/1) ... [2023-12-24 23:40:00,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:40:00,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 23:40:00,348 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 23:40:00,352 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 23:40:00,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 23:40:00,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 23:40:00,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 23:40:00,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 23:40:00,411 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 23:40:00,412 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 23:40:00,493 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 23:40:00,511 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 23:40:00,511 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-24 23:40:00,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:40:00 BoogieIcfgContainer [2023-12-24 23:40:00,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 23:40:00,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 23:40:00,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 23:40:00,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 23:40:00,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 11:40:00" (1/3) ... [2023-12-24 23:40:00,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b19a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:40:00, skipping insertion in model container [2023-12-24 23:40:00,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:40:00" (2/3) ... [2023-12-24 23:40:00,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b19a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:40:00, skipping insertion in model container [2023-12-24 23:40:00,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:40:00" (3/3) ... [2023-12-24 23:40:00,516 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_7.c [2023-12-24 23:40:00,528 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 23:40:00,528 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 23:40:00,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 23:40:00,566 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;@6ca7da4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 23:40:00,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 23:40:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 23:40:00,575 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:00,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 23:40:00,577 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:00,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2043540179, now seen corresponding path program 1 times [2023-12-24 23:40:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:00,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416627180] [2023-12-24 23:40:00,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:40:00,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 23:40:00,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:00,592 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 23:40:00,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 23:40:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:40:00,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 23:40:00,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:00,695 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 23:40:00,695 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 23:40:00,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:00,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416627180] [2023-12-24 23:40:00,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416627180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 23:40:00,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 23:40:00,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 23:40:00,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496870460] [2023-12-24 23:40:00,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 23:40:00,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 23:40:00,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:00,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 23:40:00,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 23:40:00,732 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:40:00,757 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2023-12-24 23:40:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 23:40:00,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-24 23:40:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:40:00,763 INFO L225 Difference]: With dead ends: 17 [2023-12-24 23:40:00,764 INFO L226 Difference]: Without dead ends: 8 [2023-12-24 23:40:00,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 23:40:00,773 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:40:00,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:40:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-12-24 23:40:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-12-24 23:40:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2023-12-24 23:40:00,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2023-12-24 23:40:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:40:00,792 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2023-12-24 23:40:00,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2023-12-24 23:40:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 23:40:00,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:00,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 23:40:00,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 23:40:00,994 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 23:40:00,995 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:00,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:00,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2052775389, now seen corresponding path program 1 times [2023-12-24 23:40:00,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:00,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902728880] [2023-12-24 23:40:00,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:40:00,996 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 23:40:00,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:00,997 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 23:40:01,002 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 23:40:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:40:01,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 23:40:01,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:01,029 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 23:40:01,029 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 23:40:01,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902728880] [2023-12-24 23:40:01,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902728880] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 23:40:01,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 23:40:01,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 23:40:01,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584217236] [2023-12-24 23:40:01,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 23:40:01,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 23:40:01,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:01,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 23:40:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 23:40:01,032 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:40:01,060 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2023-12-24 23:40:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 23:40:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-24 23:40:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:40:01,061 INFO L225 Difference]: With dead ends: 17 [2023-12-24 23:40:01,061 INFO L226 Difference]: Without dead ends: 10 [2023-12-24 23:40:01,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 23:40:01,062 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:40:01,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:40:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-12-24 23:40:01,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-12-24 23:40:01,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-12-24 23:40:01,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2023-12-24 23:40:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:40:01,065 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-12-24 23:40:01,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-12-24 23:40:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 23:40:01,065 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:01,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:40:01,071 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 23:40:01,267 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 23:40:01,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:01,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash 82784800, now seen corresponding path program 1 times [2023-12-24 23:40:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805020794] [2023-12-24 23:40:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:40:01,269 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 23:40:01,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:01,270 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 23:40:01,272 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 23:40:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:40:01,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 23:40:01,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:01,309 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 23:40:01,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:40:01,335 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 23:40:01,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805020794] [2023-12-24 23:40:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805020794] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:40:01,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:40:01,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 23:40:01,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931718476] [2023-12-24 23:40:01,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:40:01,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 23:40:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:01,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 23:40:01,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 23:40:01,337 INFO L87 Difference]: Start difference. First operand 10 states and 12 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 23:40:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:40:01,391 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2023-12-24 23:40:01,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 23:40:01,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-24 23:40:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:40:01,392 INFO L225 Difference]: With dead ends: 22 [2023-12-24 23:40:01,392 INFO L226 Difference]: Without dead ends: 15 [2023-12-24 23:40:01,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-24 23:40:01,393 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:40:01,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:40:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-24 23:40:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-24 23:40:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-24 23:40:01,396 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 8 [2023-12-24 23:40:01,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:40:01,396 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-24 23:40:01,396 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 23:40:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-24 23:40:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 23:40:01,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:01,397 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:40:01,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 23:40:01,598 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 23:40:01,599 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:01,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2105829779, now seen corresponding path program 1 times [2023-12-24 23:40:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:01,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135514139] [2023-12-24 23:40:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:40:01,600 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 23:40:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:01,603 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 23:40:01,604 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 23:40:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:40:01,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 23:40:01,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 23:40:01,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:40:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 23:40:01,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:01,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135514139] [2023-12-24 23:40:01,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135514139] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:40:01,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:40:01,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 23:40:01,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707870085] [2023-12-24 23:40:01,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:40:01,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 23:40:01,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 23:40:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 23:40:01,721 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 23:40:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:40:01,802 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2023-12-24 23:40:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 23:40:01,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 14 [2023-12-24 23:40:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:40:01,804 INFO L225 Difference]: With dead ends: 33 [2023-12-24 23:40:01,804 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 23:40:01,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-24 23:40:01,808 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:40:01,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:40:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 23:40:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-24 23:40:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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 23:40:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-24 23:40:01,815 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2023-12-24 23:40:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:40:01,816 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-24 23:40:01,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 23:40:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-24 23:40:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-24 23:40:01,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:01,816 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:40:01,821 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 23:40:02,021 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 23:40:02,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:02,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:02,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2017325575, now seen corresponding path program 2 times [2023-12-24 23:40:02,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:02,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903212476] [2023-12-24 23:40:02,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 23:40:02,022 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 23:40:02,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:02,028 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 23:40:02,031 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 23:40:02,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 23:40:02,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:40:02,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 23:40:02,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 23:40:02,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:40:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 23:40:02,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:02,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903212476] [2023-12-24 23:40:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903212476] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:40:02,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:40:02,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-24 23:40:02,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743324644] [2023-12-24 23:40:02,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:40:02,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 23:40:02,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:02,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 23:40:02,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-24 23:40:02,318 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:40:02,617 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2023-12-24 23:40:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 23:40:02,618 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-24 23:40:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:40:02,618 INFO L225 Difference]: With dead ends: 49 [2023-12-24 23:40:02,618 INFO L226 Difference]: Without dead ends: 39 [2023-12-24 23:40:02,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2023-12-24 23:40:02,619 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 23:40:02,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 23:40:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-24 23:40:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-24 23:40:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2023-12-24 23:40:02,625 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2023-12-24 23:40:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:40:02,625 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2023-12-24 23:40:02,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2023-12-24 23:40:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 23:40:02,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:02,626 INFO L195 NwaCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:40:02,630 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 23:40:02,828 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 23:40:02,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:02,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1737746159, now seen corresponding path program 3 times [2023-12-24 23:40:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731397500] [2023-12-24 23:40:02,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 23:40:02,829 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 23:40:02,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:02,830 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 23:40:02,832 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 23:40:02,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-24 23:40:02,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:40:02,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 23:40:02,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-12-24 23:40:02,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:40:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-12-24 23:40:02,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731397500] [2023-12-24 23:40:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731397500] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:40:02,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:40:02,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 23:40:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208936666] [2023-12-24 23:40:02,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:40:02,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 23:40:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:02,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 23:40:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 23:40:02,988 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 23:40:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:40:03,070 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2023-12-24 23:40:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 23:40:03,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-24 23:40:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:40:03,073 INFO L225 Difference]: With dead ends: 79 [2023-12-24 23:40:03,073 INFO L226 Difference]: Without dead ends: 75 [2023-12-24 23:40:03,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-24 23:40:03,074 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:40:03,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:40:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-24 23:40:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2023-12-24 23:40:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 23:40:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2023-12-24 23:40:03,084 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 38 [2023-12-24 23:40:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:40:03,085 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-12-24 23:40:03,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 23:40:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2023-12-24 23:40:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-24 23:40:03,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:03,086 INFO L195 NwaCegarLoop]: trace histogram [16, 14, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:40:03,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-24 23:40:03,288 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 23:40:03,288 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:03,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:03,289 INFO L85 PathProgramCache]: Analyzing trace with hash -686232931, now seen corresponding path program 1 times [2023-12-24 23:40:03,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:03,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372271746] [2023-12-24 23:40:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:40:03,289 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 23:40:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:03,290 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 23:40:03,291 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 23:40:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:40:03,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-24 23:40:03,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 23:40:03,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:40:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 23:40:04,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:04,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372271746] [2023-12-24 23:40:04,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372271746] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:40:04,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:40:04,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-12-24 23:40:04,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229004967] [2023-12-24 23:40:04,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:40:04,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-24 23:40:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:04,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-24 23:40:04,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2023-12-24 23:40:04,032 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:40:05,747 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2023-12-24 23:40:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-24 23:40:05,748 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-24 23:40:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:40:05,748 INFO L225 Difference]: With dead ends: 125 [2023-12-24 23:40:05,748 INFO L226 Difference]: Without dead ends: 94 [2023-12-24 23:40:05,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2023-12-24 23:40:05,750 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 23:40:05,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 23:40:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-24 23:40:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-24 23:40:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 93 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2023-12-24 23:40:05,763 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 41 [2023-12-24 23:40:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:40:05,763 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2023-12-24 23:40:05,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:40:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2023-12-24 23:40:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-24 23:40:05,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:05,767 INFO L195 NwaCegarLoop]: trace histogram [32, 30, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:40:05,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 23:40:05,972 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 23:40:05,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:05,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash -466526515, now seen corresponding path program 2 times [2023-12-24 23:40:05,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:05,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518742862] [2023-12-24 23:40:05,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 23:40:05,973 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 23:40:05,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:05,974 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 23:40:05,982 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 23:40:06,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 23:40:06,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:40:06,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-24 23:40:06,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 23:40:06,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:40:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 23:40:08,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518742862] [2023-12-24 23:40:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518742862] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:40:08,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:40:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2023-12-24 23:40:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504053033] [2023-12-24 23:40:08,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:40:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-12-24 23:40:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:08,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-12-24 23:40:08,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2946, Unknown=0, NotChecked=0, Total=4032 [2023-12-24 23:40:08,791 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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 23:40:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:40:21,531 INFO L93 Difference]: Finished difference Result 189 states and 250 transitions. [2023-12-24 23:40:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-12-24 23:40:21,532 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 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 73 [2023-12-24 23:40:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:40:21,533 INFO L225 Difference]: With dead ends: 189 [2023-12-24 23:40:21,533 INFO L226 Difference]: Without dead ends: 158 [2023-12-24 23:40:21,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=3006, Invalid=5736, Unknown=0, NotChecked=0, Total=8742 [2023-12-24 23:40:21,535 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 23:40:21,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 23:40:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-24 23:40:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2023-12-24 23:40:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.1019108280254777) internal successors, (173), 157 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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 23:40:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2023-12-24 23:40:21,547 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 73 [2023-12-24 23:40:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:40:21,547 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2023-12-24 23:40:21,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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 23:40:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2023-12-24 23:40:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-24 23:40:21,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:21,548 INFO L195 NwaCegarLoop]: trace histogram [64, 62, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:40:21,553 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 23:40:21,751 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 23:40:21,751 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:21,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1907620051, now seen corresponding path program 3 times [2023-12-24 23:40:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:21,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157470457] [2023-12-24 23:40:21,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 23:40:21,753 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 23:40:21,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:21,757 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 23:40:21,758 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 23:40:21,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-24 23:40:21,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:40:21,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 23:40:21,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4102 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2023-12-24 23:40:21,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:40:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4102 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2023-12-24 23:40:22,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:22,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157470457] [2023-12-24 23:40:22,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157470457] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:40:22,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:40:22,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 23:40:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335231632] [2023-12-24 23:40:22,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:40:22,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 23:40:22,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:22,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 23:40:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:40:22,632 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 23:40:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:40:22,946 INFO L93 Difference]: Finished difference Result 191 states and 224 transitions. [2023-12-24 23:40:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 23:40:22,947 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2023-12-24 23:40:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:40:22,948 INFO L225 Difference]: With dead ends: 191 [2023-12-24 23:40:22,948 INFO L226 Difference]: Without dead ends: 187 [2023-12-24 23:40:22,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2023-12-24 23:40:22,948 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 23:40:22,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 64 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 23:40:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-24 23:40:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2023-12-24 23:40:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.1468926553672316) internal successors, (203), 177 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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 23:40:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2023-12-24 23:40:22,961 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 137 [2023-12-24 23:40:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:40:22,961 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2023-12-24 23:40:22,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 23:40:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2023-12-24 23:40:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-24 23:40:22,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:40:22,962 INFO L195 NwaCegarLoop]: trace histogram [65, 62, 4, 3, 1, 1, 1, 1, 1, 1] [2023-12-24 23:40:22,970 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 23:40:23,162 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 23:40:23,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:40:23,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:40:23,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1498207386, now seen corresponding path program 4 times [2023-12-24 23:40:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:40:23,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537175465] [2023-12-24 23:40:23,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 23:40:23,164 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 23:40:23,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:40:23,165 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 23:40:23,166 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 23:40:23,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 23:40:23,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:40:23,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 126 conjunts are in the unsatisfiable core [2023-12-24 23:40:23,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:40:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 315 proven. 3906 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-24 23:40:24,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:40:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 315 proven. 3906 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-24 23:40:32,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:40:32,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537175465] [2023-12-24 23:40:32,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537175465] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:40:32,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:40:32,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 127 [2023-12-24 23:40:32,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927911232] [2023-12-24 23:40:32,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:40:32,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2023-12-24 23:40:32,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:40:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2023-12-24 23:40:32,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4222, Invalid=12034, Unknown=0, NotChecked=0, Total=16256 [2023-12-24 23:40:32,969 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 128 states, 128 states have (on average 2.046875) internal successors, (262), 127 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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 23:42:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:42:28,052 INFO L93 Difference]: Finished difference Result 357 states and 470 transitions. [2023-12-24 23:42:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2023-12-24 23:42:28,053 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 2.046875) internal successors, (262), 127 states have internal predecessors, (262), 0 states have call successors, (0), 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 140 [2023-12-24 23:42:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:42:28,054 INFO L225 Difference]: With dead ends: 357 [2023-12-24 23:42:28,054 INFO L226 Difference]: Without dead ends: 306 [2023-12-24 23:42:28,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 121.6s TimeCoverageRelationStatistics Valid=12158, Invalid=23752, Unknown=0, NotChecked=0, Total=35910 [2023-12-24 23:42:28,060 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 8380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 8381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-24 23:42:28,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 8381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8380 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-24 23:42:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-12-24 23:42:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2023-12-24 23:42:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.0852459016393443) internal successors, (331), 305 states have internal predecessors, (331), 0 states have call successors, (0), 0 states 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 23:42:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 331 transitions. [2023-12-24 23:42:28,076 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 331 transitions. Word has length 140 [2023-12-24 23:42:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:42:28,077 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 331 transitions. [2023-12-24 23:42:28,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 2.046875) internal successors, (262), 127 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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 23:42:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 331 transitions. [2023-12-24 23:42:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2023-12-24 23:42:28,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:42:28,079 INFO L195 NwaCegarLoop]: trace histogram [129, 126, 4, 3, 1, 1, 1, 1, 1, 1] [2023-12-24 23:42:28,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-24 23:42:28,283 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 23:42:28,283 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:42:28,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:42:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1197093926, now seen corresponding path program 5 times [2023-12-24 23:42:28,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:42:28,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051277344] [2023-12-24 23:42:28,284 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-24 23:42:28,285 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 23:42:28,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:42:28,285 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 23:42:28,299 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 23:42:29,252 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 130 check-sat command(s) [2023-12-24 23:42:29,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:42:29,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 269 conjunts are in the unsatisfiable core [2023-12-24 23:42:29,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:42:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16651 backedges. 635 proven. 16002 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-24 23:42:34,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:43:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16651 backedges. 635 proven. 16002 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-24 23:43:13,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:43:13,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051277344] [2023-12-24 23:43:13,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051277344] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:43:13,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:43:13,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 129] total 256 [2023-12-24 23:43:13,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053048682] [2023-12-24 23:43:13,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:43:13,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 257 states [2023-12-24 23:43:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:43:13,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 257 interpolants. [2023-12-24 23:43:13,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16768, Invalid=49024, Unknown=0, NotChecked=0, Total=65792 [2023-12-24 23:43:13,775 INFO L87 Difference]: Start difference. First operand 306 states and 331 transitions. Second operand has 257 states, 257 states have (on average 2.0155642023346303) internal successors, (518), 256 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-24 23:54:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2023-12-24 23:54:35,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 712.6s TimeCoverageRelationStatistics Valid=30389, Invalid=65401, Unknown=0, NotChecked=0, Total=95790 [2023-12-24 23:54:35,915 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32491 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 32546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 32491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:35,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 32546 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 32491 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-12-24 23:54:35,916 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 23:54:35,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-24 23:54:35,944 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 23:54:35,946 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 23:54:36,122 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 23:54:36,123 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (306states) and FLOYD_HOARE automaton (currently 182 states, 257 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 310 known predicates. [2023-12-24 23:54:36,126 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1] [2023-12-24 23:54:36,128 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 23:54:36,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 11:54:36 BoogieIcfgContainer [2023-12-24 23:54:36,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 23:54:36,130 INFO L158 Benchmark]: Toolchain (without parser) took 876047.30ms. Allocated memory was 309.3MB in the beginning and 371.2MB in the end (delta: 61.9MB). Free memory was 258.9MB in the beginning and 112.3MB in the end (delta: 146.5MB). Peak memory consumption was 208.9MB. Max. memory is 8.0GB. [2023-12-24 23:54:36,130 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 230.7MB. Free memory is still 182.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 23:54:36,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.84ms. Allocated memory is still 309.3MB. Free memory was 258.6MB in the beginning and 247.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-24 23:54:36,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.80ms. Allocated memory is still 309.3MB. Free memory was 247.7MB in the beginning and 246.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 23:54:36,130 INFO L158 Benchmark]: Boogie Preprocessor took 36.41ms. Allocated memory is still 309.3MB. Free memory was 246.0MB in the beginning and 244.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 23:54:36,130 INFO L158 Benchmark]: RCFGBuilder took 185.17ms. Allocated memory is still 309.3MB. Free memory was 244.2MB in the beginning and 233.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 23:54:36,131 INFO L158 Benchmark]: TraceAbstraction took 875616.77ms. Allocated memory was 309.3MB in the beginning and 371.2MB in the end (delta: 61.9MB). Free memory was 232.7MB in the beginning and 112.3MB in the end (delta: 120.4MB). Peak memory consumption was 182.6MB. Max. memory is 8.0GB. [2023-12-24 23:54:36,132 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 230.7MB. Free memory is still 182.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.84ms. Allocated memory is still 309.3MB. Free memory was 258.6MB in the beginning and 247.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.80ms. Allocated memory is still 309.3MB. Free memory was 247.7MB in the beginning and 246.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.41ms. Allocated memory is still 309.3MB. Free memory was 246.0MB in the beginning and 244.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 185.17ms. Allocated memory is still 309.3MB. Free memory was 244.2MB in the beginning and 233.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 875616.77ms. Allocated memory was 309.3MB in the beginning and 371.2MB in the end (delta: 61.9MB). Free memory was 232.7MB in the beginning and 112.3MB in the end (delta: 120.4MB). Peak memory consumption was 182.6MB. 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: 4]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4). Cancelled while NwaCegarLoop was constructing difference of abstraction (306states) and FLOYD_HOARE automaton (currently 182 states, 257 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 310 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 875.6s, OverallIterations: 11, TraceHistogramMax: 129, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 812.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 537 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 458 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43889 IncrementalHoareTripleChecker+Invalid, 43982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 79 mSDtfsCounter, 43889 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1652 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 691 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3959 ImplicationChecksByTransitivity, 851.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=10, InterpolantAutomatonStates: 286, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 59.1s InterpolantComputationTime, 753 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 148 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 8103 SizeOfPredicates, 241 NumberOfNonLiveVariables, 1326 ConjunctsInSsa, 526 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 10556/53234 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