/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:20:05,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:20:05,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:20:05,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:20:05,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:20:05,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:20:05,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:20:05,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:20:05,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:20:05,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:20:05,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:20:05,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:20:05,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:20:05,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:20:05,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:20:05,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:20:05,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:20:05,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:20:05,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:20:05,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:20:05,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:20:05,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:20:05,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:20:05,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:20:05,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:20:05,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:20:05,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:20:05,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:20:05,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:20:05,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:20:05,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:20:05,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:20:05,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:20:05,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:20:05,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:20:05,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:20:05,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:20:05,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:20:05,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:20:05,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:20:05,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:20:05,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:20:05,584 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:20:05,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:20:05,585 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:20:05,585 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:20:05,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:20:05,586 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:20:05,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:20:05,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:20:05,586 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:20:05,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:20:05,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:20:05,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:20:05,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:20:05,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:20:05,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:20:05,588 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:20:05,588 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:20:05,588 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:20:05,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:20:05,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:20:05,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:20:05,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:20:05,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:20:05,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:20:05,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:20:05,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:20:05,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:20:05,590 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:20:05,590 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:20:05,591 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:20:05,591 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:20:05,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:20:05,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:20:05,591 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:20:05,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:20:05,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:20:05,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:20:05,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:20:05,844 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:20:05,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c [2022-01-10 03:20:05,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f65a43f/6c6672aa273c47fb949fd50a9662a342/FLAG05c4be055 [2022-01-10 03:20:06,301 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:20:06,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c [2022-01-10 03:20:06,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f65a43f/6c6672aa273c47fb949fd50a9662a342/FLAG05c4be055 [2022-01-10 03:20:06,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f65a43f/6c6672aa273c47fb949fd50a9662a342 [2022-01-10 03:20:06,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:20:06,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:20:06,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:20:06,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:20:06,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:20:06,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:20:06" (1/1) ... [2022-01-10 03:20:06,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608e72bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:06, skipping insertion in model container [2022-01-10 03:20:06,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:20:06" (1/1) ... [2022-01-10 03:20:06,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:20:06,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:20:06,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c[526,539] [2022-01-10 03:20:06,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:20:06,978 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:20:06,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c[526,539] [2022-01-10 03:20:07,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:20:07,024 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:20:07,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07 WrapperNode [2022-01-10 03:20:07,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:20:07,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:20:07,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:20:07,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:20:07,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,058 INFO L137 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2022-01-10 03:20:07,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:20:07,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:20:07,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:20:07,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:20:07,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:20:07,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:20:07,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:20:07,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:20:07,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (1/1) ... [2022-01-10 03:20:07,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:20:07,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:20:07,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:20:07,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:20:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:20:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:20:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:20:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:20:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:20:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:20:07,216 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:20:07,217 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:20:07,346 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:20:07,351 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:20:07,351 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 03:20:07,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:20:07 BoogieIcfgContainer [2022-01-10 03:20:07,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:20:07,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:20:07,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:20:07,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:20:07,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:20:06" (1/3) ... [2022-01-10 03:20:07,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35977d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:20:07, skipping insertion in model container [2022-01-10 03:20:07,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:20:07" (2/3) ... [2022-01-10 03:20:07,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35977d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:20:07, skipping insertion in model container [2022-01-10 03:20:07,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:20:07" (3/3) ... [2022-01-10 03:20:07,365 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound100.c [2022-01-10 03:20:07,377 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:20:07,378 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:20:07,441 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:20:07,460 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:20:07,461 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:20:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 03:20:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 03:20:07,496 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:07,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:07,496 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:07,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash 643118537, now seen corresponding path program 1 times [2022-01-10 03:20:07,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:07,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57052971] [2022-01-10 03:20:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:07,512 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:07,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:07,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:20:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:07,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:20:07,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:20:07,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:20:07,607 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:07,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57052971] [2022-01-10 03:20:07,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57052971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:20:07,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:20:07,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:20:07,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914690144] [2022-01-10 03:20:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:20:07,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:20:07,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:07,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:20:07,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:20:07,640 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:20:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:20:07,658 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2022-01-10 03:20:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:20:07,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-01-10 03:20:07,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:20:07,671 INFO L225 Difference]: With dead ends: 50 [2022-01-10 03:20:07,671 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 03:20:07,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:20:07,676 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:20:07,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:20:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 03:20:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 03:20:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:20:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-01-10 03:20:07,730 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 8 [2022-01-10 03:20:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:20:07,730 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-01-10 03:20:07,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:20:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-01-10 03:20:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 03:20:07,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:07,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:07,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:20:07,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:20:07,940 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash 181060127, now seen corresponding path program 1 times [2022-01-10 03:20:07,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:07,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853375986] [2022-01-10 03:20:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:07,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:07,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:07,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:07,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:20:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:07,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:20:07,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:20:08,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:20:08,032 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:08,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853375986] [2022-01-10 03:20:08,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853375986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:20:08,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:20:08,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:20:08,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130813169] [2022-01-10 03:20:08,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:20:08,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:20:08,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:08,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:20:08,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:20:08,035 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:20:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:20:08,125 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-01-10 03:20:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:20:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-01-10 03:20:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:20:08,127 INFO L225 Difference]: With dead ends: 36 [2022-01-10 03:20:08,127 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 03:20:08,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:20:08,129 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:20:08,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:20:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 03:20:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-01-10 03:20:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:20:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-01-10 03:20:08,138 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 8 [2022-01-10 03:20:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:20:08,139 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-01-10 03:20:08,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:20:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-01-10 03:20:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 03:20:08,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:08,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:08,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:20:08,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:20:08,354 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:08,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash -712280900, now seen corresponding path program 1 times [2022-01-10 03:20:08,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:08,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601763386] [2022-01-10 03:20:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:08,356 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:08,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:08,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:20:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:08,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:20:08,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:20:08,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:20:08,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:08,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601763386] [2022-01-10 03:20:08,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601763386] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:20:08,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:20:08,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:20:08,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393916375] [2022-01-10 03:20:08,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:20:08,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:20:08,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:08,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:20:08,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:20:08,445 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:20:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:20:08,464 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2022-01-10 03:20:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:20:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-01-10 03:20:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:20:08,466 INFO L225 Difference]: With dead ends: 42 [2022-01-10 03:20:08,466 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 03:20:08,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:20:08,468 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:20:08,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:20:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 03:20:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 03:20:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:20:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-01-10 03:20:08,473 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-01-10 03:20:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:20:08,474 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-01-10 03:20:08,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:20:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-01-10 03:20:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 03:20:08,474 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:08,475 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:08,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:20:08,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:20:08,684 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:08,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2036073049, now seen corresponding path program 1 times [2022-01-10 03:20:08,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:08,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071568615] [2022-01-10 03:20:08,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:08,686 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:08,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:08,687 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:08,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:20:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:08,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:20:08,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:20:08,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:20:08,798 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:08,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071568615] [2022-01-10 03:20:08,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071568615] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:20:08,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:20:08,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:20:08,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754212229] [2022-01-10 03:20:08,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:20:08,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:20:08,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:08,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:20:08,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:20:08,805 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:20:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:20:08,941 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-01-10 03:20:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:20:08,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-01-10 03:20:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:20:08,942 INFO L225 Difference]: With dead ends: 42 [2022-01-10 03:20:08,943 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 03:20:08,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:20:08,944 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:20:08,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 102 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:20:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 03:20:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-01-10 03:20:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:20:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-01-10 03:20:08,951 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-01-10 03:20:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:20:08,952 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-01-10 03:20:08,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:20:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-01-10 03:20:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 03:20:08,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:08,954 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:08,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:20:09,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:20:09,162 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 380169759, now seen corresponding path program 1 times [2022-01-10 03:20:09,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:09,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267400477] [2022-01-10 03:20:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:09,164 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:09,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:09,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:09,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:20:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:09,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:20:09,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:20:09,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:20:09,302 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:09,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267400477] [2022-01-10 03:20:09,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267400477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:20:09,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:20:09,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:20:09,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208958446] [2022-01-10 03:20:09,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:20:09,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:20:09,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:20:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:20:09,304 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:20:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:20:09,433 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-01-10 03:20:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:20:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-01-10 03:20:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:20:09,434 INFO L225 Difference]: With dead ends: 61 [2022-01-10 03:20:09,434 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 03:20:09,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:20:09,435 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:20:09,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:20:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 03:20:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 03:20:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 03:20:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-01-10 03:20:09,443 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2022-01-10 03:20:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:20:09,443 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-01-10 03:20:09,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:20:09,445 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-01-10 03:20:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 03:20:09,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:09,446 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:09,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:20:09,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:20:09,655 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:09,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:09,655 INFO L85 PathProgramCache]: Analyzing trace with hash -461064832, now seen corresponding path program 1 times [2022-01-10 03:20:09,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:09,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145226776] [2022-01-10 03:20:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:09,656 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:09,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:09,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:09,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:20:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:09,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:20:09,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 03:20:09,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:20:09,874 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:09,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145226776] [2022-01-10 03:20:09,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145226776] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:20:09,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:20:09,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:20:09,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581590546] [2022-01-10 03:20:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:20:09,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:20:09,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:20:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:20:09,876 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:20:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:20:09,983 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-01-10 03:20:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:20:09,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-01-10 03:20:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:20:09,988 INFO L225 Difference]: With dead ends: 60 [2022-01-10 03:20:09,988 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 03:20:09,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:20:09,991 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:20:09,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:20:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 03:20:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-01-10 03:20:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-10 03:20:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2022-01-10 03:20:10,001 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 26 [2022-01-10 03:20:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:20:10,002 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-01-10 03:20:10,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:20:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-01-10 03:20:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 03:20:10,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:10,003 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:10,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:20:10,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:20:10,219 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash -909290541, now seen corresponding path program 1 times [2022-01-10 03:20:10,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:10,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114374679] [2022-01-10 03:20:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:10,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:10,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:10,221 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:10,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:20:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:10,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:20:10,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 03:20:10,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:20:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:20:10,522 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:10,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114374679] [2022-01-10 03:20:10,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114374679] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:20:10,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:20:10,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-01-10 03:20:10,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326368663] [2022-01-10 03:20:10,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:20:10,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:20:10,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:10,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:20:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:20:10,524 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 03:20:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:20:10,835 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2022-01-10 03:20:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 03:20:10,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2022-01-10 03:20:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:20:10,842 INFO L225 Difference]: With dead ends: 140 [2022-01-10 03:20:10,842 INFO L226 Difference]: Without dead ends: 115 [2022-01-10 03:20:10,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:20:10,843 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 43 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:20:10,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 181 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 03:20:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-10 03:20:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2022-01-10 03:20:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 73 states have internal predecessors, (85), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-01-10 03:20:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2022-01-10 03:20:10,859 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 33 [2022-01-10 03:20:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:20:10,859 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2022-01-10 03:20:10,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 03:20:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-01-10 03:20:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 03:20:10,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:10,860 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:10,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 03:20:11,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:20:11,070 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:11,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash 252591112, now seen corresponding path program 1 times [2022-01-10 03:20:11,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:11,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151508488] [2022-01-10 03:20:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:11,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:11,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:11,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:11,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:20:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:11,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:20:11,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:20:11,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:20:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:20:11,833 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:11,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151508488] [2022-01-10 03:20:11,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151508488] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:20:11,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:20:11,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-01-10 03:20:11,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188628201] [2022-01-10 03:20:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:20:11,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 03:20:11,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 03:20:11,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:20:11,836 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:20:13,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:20:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:20:14,309 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2022-01-10 03:20:14,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:20:14,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-01-10 03:20:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:20:14,311 INFO L225 Difference]: With dead ends: 125 [2022-01-10 03:20:14,311 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 03:20:14,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:20:14,312 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-10 03:20:14,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 96 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-10 03:20:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 03:20:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2022-01-10 03:20:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 80 states have internal predecessors, (91), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-10 03:20:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-01-10 03:20:14,331 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 36 [2022-01-10 03:20:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:20:14,332 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-01-10 03:20:14,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:20:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-01-10 03:20:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 03:20:14,337 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:14,337 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:14,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 03:20:14,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:20:14,538 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:14,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1605675221, now seen corresponding path program 1 times [2022-01-10 03:20:14,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:14,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761619060] [2022-01-10 03:20:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:14,539 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:14,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:14,540 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:14,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 03:20:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:14,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:20:14,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 03:20:14,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:20:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-10 03:20:14,901 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:14,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761619060] [2022-01-10 03:20:14,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761619060] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:20:14,901 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:20:14,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-01-10 03:20:14,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916286267] [2022-01-10 03:20:14,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:20:14,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:20:14,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:14,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:20:14,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:20:14,903 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-01-10 03:20:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:20:15,656 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2022-01-10 03:20:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:20:15,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2022-01-10 03:20:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:20:15,661 INFO L225 Difference]: With dead ends: 241 [2022-01-10 03:20:15,661 INFO L226 Difference]: Without dead ends: 220 [2022-01-10 03:20:15,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-10 03:20:15,662 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 94 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 03:20:15,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 301 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 03:20:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-01-10 03:20:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 213. [2022-01-10 03:20:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 138 states have (on average 1.1956521739130435) internal successors, (165), 147 states have internal predecessors, (165), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2022-01-10 03:20:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 259 transitions. [2022-01-10 03:20:15,697 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 259 transitions. Word has length 49 [2022-01-10 03:20:15,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:20:15,698 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 259 transitions. [2022-01-10 03:20:15,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-01-10 03:20:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 259 transitions. [2022-01-10 03:20:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 03:20:15,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:20:15,699 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:20:15,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 03:20:15,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:20:15,900 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:20:15,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:20:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1800695307, now seen corresponding path program 1 times [2022-01-10 03:20:15,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:20:15,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061341771] [2022-01-10 03:20:15,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:20:15,901 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:20:15,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:20:15,903 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:20:15,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 03:20:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:20:15,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 03:20:15,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:20:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 03:20:16,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:20:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 03:20:25,503 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:20:25,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061341771] [2022-01-10 03:20:25,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061341771] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:20:25,504 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:20:25,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-01-10 03:20:25,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134613746] [2022-01-10 03:20:25,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:20:25,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 03:20:25,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:20:25,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 03:20:25,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:20:25,506 INFO L87 Difference]: Start difference. First operand 213 states and 259 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-01-10 03:20:33,766 WARN L228 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-10 03:20:37,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:20:39,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:20:55,861 WARN L228 SmtUtils]: Spent 16.13s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-10 03:20:59,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:21:03,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:21:10,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:21:14,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:21:18,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:21:23,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []