/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-21 20:31:03,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 20:31:03,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 20:31:03,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 20:31:03,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 20:31:03,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 20:31:03,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 20:31:03,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 20:31:03,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 20:31:03,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 20:31:03,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 20:31:03,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 20:31:03,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 20:31:03,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 20:31:03,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 20:31:03,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 20:31:03,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 20:31:03,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 20:31:03,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 20:31:03,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 20:31:03,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 20:31:03,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 20:31:03,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 20:31:03,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 20:31:03,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 20:31:03,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 20:31:03,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 20:31:03,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 20:31:03,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 20:31:03,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 20:31:03,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 20:31:03,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 20:31:03,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 20:31:03,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 20:31:03,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 20:31:03,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 20:31:03,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 20:31:03,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 20:31:03,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 20:31:03,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 20:31:03,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 20:31:03,876 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-21 20:31:03,901 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 20:31:03,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 20:31:03,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 20:31:03,906 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 20:31:03,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 20:31:03,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 20:31:03,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 20:31:03,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 20:31:03,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 20:31:03,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 20:31:03,909 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 20:31:03,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 20:31:03,909 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 20:31:03,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 20:31:03,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 20:31:03,910 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-21 20:31:03,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-21 20:31:03,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 20:31:03,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 20:31:03,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 20:31:03,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-21 20:31:03,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 20:31:03,911 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 [2021-02-21 20:31:04,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 20:31:04,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 20:31:04,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 20:31:04,382 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 20:31:04,388 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 20:31:04,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2021-02-21 20:31:04,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be519e7c1/23ac55d15c3b4690bac4417b90da4b88/FLAGbd019d1e6 [2021-02-21 20:31:05,034 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 20:31:05,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2021-02-21 20:31:05,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be519e7c1/23ac55d15c3b4690bac4417b90da4b88/FLAGbd019d1e6 [2021-02-21 20:31:05,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be519e7c1/23ac55d15c3b4690bac4417b90da4b88 [2021-02-21 20:31:05,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 20:31:05,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 20:31:05,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 20:31:05,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 20:31:05,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 20:31:05,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:31:05" (1/1) ... [2021-02-21 20:31:05,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442f49a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05, skipping insertion in model container [2021-02-21 20:31:05,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:31:05" (1/1) ... [2021-02-21 20:31:05,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 20:31:05,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 20:31:05,691 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c[493,506] [2021-02-21 20:31:05,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:31:05,730 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 20:31:05,745 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c[493,506] [2021-02-21 20:31:05,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:31:05,774 INFO L208 MainTranslator]: Completed translation [2021-02-21 20:31:05,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05 WrapperNode [2021-02-21 20:31:05,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 20:31:05,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 20:31:05,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 20:31:05,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 20:31:05,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05" (1/1) ... [2021-02-21 20:31:05,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05" (1/1) ... [2021-02-21 20:31:05,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05" (1/1) ... [2021-02-21 20:31:05,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05" (1/1) ... [2021-02-21 20:31:05,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05" (1/1) ... [2021-02-21 20:31:05,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05" (1/1) ... [2021-02-21 20:31:05,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05" (1/1) ... [2021-02-21 20:31:05,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 20:31:05,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 20:31:05,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 20:31:05,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 20:31:05,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 20:31:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 20:31:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 20:31:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 20:31:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-21 20:31:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-02-21 20:31:05,949 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-02-21 20:31:05,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 20:31:05,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-02-21 20:31:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-21 20:31:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-21 20:31:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 20:31:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 20:31:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 20:31:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 20:31:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-21 20:31:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-21 20:31:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-21 20:31:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-02-21 20:31:05,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 20:31:05,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 20:31:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-21 20:31:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-02-21 20:31:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 20:31:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 20:31:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 20:31:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 20:31:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 20:31:06,477 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 20:31:06,477 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-21 20:31:06,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:31:06 BoogieIcfgContainer [2021-02-21 20:31:06,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 20:31:06,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 20:31:06,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 20:31:06,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 20:31:06,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 08:31:05" (1/3) ... [2021-02-21 20:31:06,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18158708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:31:06, skipping insertion in model container [2021-02-21 20:31:06,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:05" (2/3) ... [2021-02-21 20:31:06,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18158708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:31:06, skipping insertion in model container [2021-02-21 20:31:06,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:31:06" (3/3) ... [2021-02-21 20:31:06,489 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2021-02-21 20:31:06,496 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-21 20:31:06,500 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 20:31:06,519 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 20:31:06,544 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 20:31:06,544 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 20:31:06,545 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-21 20:31:06,545 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 20:31:06,545 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 20:31:06,545 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 20:31:06,545 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 20:31:06,545 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 20:31:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2021-02-21 20:31:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-02-21 20:31:06,573 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:06,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:06,575 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2141980220, now seen corresponding path program 1 times [2021-02-21 20:31:06,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:06,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [755337879] [2021-02-21 20:31:06,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:06,671 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:06,936 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:06,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:06,946 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:06,947 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:06,964 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:06,965 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:06,976 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:06,977 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:06,990 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:06,991 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:07,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:07,004 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:07,014 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:07,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:07,026 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:07,027 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:07,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:07,079 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:07,080 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:07,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:07,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:07,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:07,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 20:31:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:07,109 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:07,110 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:31:07,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [755337879] [2021-02-21 20:31:07,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:07,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-21 20:31:07,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579667043] [2021-02-21 20:31:07,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-21 20:31:07,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-21 20:31:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-02-21 20:31:07,153 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 10 states. [2021-02-21 20:31:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:08,277 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2021-02-21 20:31:08,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-21 20:31:08,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2021-02-21 20:31:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:08,295 INFO L225 Difference]: With dead ends: 215 [2021-02-21 20:31:08,296 INFO L226 Difference]: Without dead ends: 128 [2021-02-21 20:31:08,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-02-21 20:31:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-02-21 20:31:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2021-02-21 20:31:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-02-21 20:31:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-02-21 20:31:08,402 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 36 [2021-02-21 20:31:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:08,403 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-02-21 20:31:08,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-21 20:31:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-02-21 20:31:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-21 20:31:08,406 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:08,407 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:08,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 20:31:08,407 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:08,408 INFO L82 PathProgramCache]: Analyzing trace with hash 572347764, now seen corresponding path program 1 times [2021-02-21 20:31:08,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:08,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497215460] [2021-02-21 20:31:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:08,413 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:08,553 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,554 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:08,555 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,556 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:08,559 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,560 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:08,564 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,565 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:08,570 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,571 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-21 20:31:08,585 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,586 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-21 20:31:08,608 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,609 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:31:08,624 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,625 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:08,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:08,687 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,688 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:08,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:08,701 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,703 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:08,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 20:31:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:08,739 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,745 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:08,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-21 20:31:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:08,769 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:08,769 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:31:08,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497215460] [2021-02-21 20:31:08,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:08,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-21 20:31:08,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265068499] [2021-02-21 20:31:08,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-21 20:31:08,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:08,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-21 20:31:08,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-02-21 20:31:08,782 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 11 states. [2021-02-21 20:31:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:09,698 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2021-02-21 20:31:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-21 20:31:09,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2021-02-21 20:31:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:09,706 INFO L225 Difference]: With dead ends: 178 [2021-02-21 20:31:09,706 INFO L226 Difference]: Without dead ends: 108 [2021-02-21 20:31:09,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-02-21 20:31:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-02-21 20:31:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-02-21 20:31:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-02-21 20:31:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2021-02-21 20:31:09,760 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 57 [2021-02-21 20:31:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:09,761 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2021-02-21 20:31:09,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-21 20:31:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2021-02-21 20:31:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-21 20:31:09,767 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:09,767 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:09,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 20:31:09,768 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:09,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2023865644, now seen corresponding path program 1 times [2021-02-21 20:31:09,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:09,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768835008] [2021-02-21 20:31:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:09,776 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:09,927 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:09,928 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:09,930 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:09,931 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:09,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:09,944 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:09,953 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:09,954 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:09,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:09,964 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:09,982 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:09,983 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:09,995 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:09,996 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:10,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:10,030 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,031 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:10,049 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,052 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:10,069 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,072 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:10,073 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:10,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:10,106 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,112 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:10,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:10,164 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,165 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:10,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:10,169 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,170 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:10,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 20:31:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:10,191 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,192 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:10,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-21 20:31:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:10,198 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:10,198 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:31:10,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768835008] [2021-02-21 20:31:10,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:10,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-21 20:31:10,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526732248] [2021-02-21 20:31:10,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-21 20:31:10,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:10,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-21 20:31:10,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-02-21 20:31:10,209 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 15 states. [2021-02-21 20:31:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:12,110 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2021-02-21 20:31:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-21 20:31:12,111 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2021-02-21 20:31:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:12,120 INFO L225 Difference]: With dead ends: 174 [2021-02-21 20:31:12,121 INFO L226 Difference]: Without dead ends: 172 [2021-02-21 20:31:12,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2021-02-21 20:31:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-02-21 20:31:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2021-02-21 20:31:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-02-21 20:31:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2021-02-21 20:31:12,213 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 57 [2021-02-21 20:31:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:12,215 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2021-02-21 20:31:12,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-21 20:31:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2021-02-21 20:31:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-21 20:31:12,230 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:12,230 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:12,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 20:31:12,231 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:12,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:12,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1959749596, now seen corresponding path program 1 times [2021-02-21 20:31:12,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:12,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1324925989] [2021-02-21 20:31:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:12,240 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,414 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,415 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,415 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,422 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,423 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,431 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,432 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,440 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,441 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,451 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,454 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,465 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,467 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,484 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,484 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,499 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,500 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,514 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,515 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,532 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,533 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,533 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,534 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,552 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,553 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,572 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,572 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,592 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,593 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,613 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,613 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,636 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,637 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:12,638 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,639 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:12,658 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,659 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:12,680 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,681 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,749 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,753 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,754 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 20:31:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,788 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,790 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-21 20:31:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,800 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,800 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-21 20:31:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,810 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,811 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:31:12,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1324925989] [2021-02-21 20:31:12,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:12,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-21 20:31:12,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476812722] [2021-02-21 20:31:12,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-21 20:31:12,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-21 20:31:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-21 20:31:12,829 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 20 states. [2021-02-21 20:31:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:15,728 INFO L93 Difference]: Finished difference Result 238 states and 260 transitions. [2021-02-21 20:31:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-21 20:31:15,728 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-21 20:31:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:15,731 INFO L225 Difference]: With dead ends: 238 [2021-02-21 20:31:15,731 INFO L226 Difference]: Without dead ends: 236 [2021-02-21 20:31:15,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2021-02-21 20:31:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-02-21 20:31:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 198. [2021-02-21 20:31:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-02-21 20:31:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2021-02-21 20:31:15,778 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 78 [2021-02-21 20:31:15,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:15,779 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2021-02-21 20:31:15,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-21 20:31:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2021-02-21 20:31:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-21 20:31:15,781 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:15,781 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:15,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 20:31:15,781 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash -636463812, now seen corresponding path program 2 times [2021-02-21 20:31:15,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:15,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1571895409] [2021-02-21 20:31:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:15,785 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:15,843 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,844 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:15,844 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,845 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,851 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,852 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,858 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,861 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,870 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,871 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,883 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,883 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,930 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,931 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,944 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,945 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,960 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,961 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,980 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,985 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,985 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:16,008 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:16,035 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,037 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:16,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:16,080 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,081 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:16,105 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,105 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:16,106 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,107 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:16,125 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,127 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:16,147 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,148 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:16,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:16,194 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:16,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:16,199 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,200 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:16,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 20:31:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:16,224 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,224 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:16,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-21 20:31:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:16,229 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,230 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:16,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-21 20:31:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:16,234 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:16,234 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:31:16,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1571895409] [2021-02-21 20:31:16,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:16,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-21 20:31:16,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101262376] [2021-02-21 20:31:16,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-21 20:31:16,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:16,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-21 20:31:16,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-21 20:31:16,251 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 20 states. [2021-02-21 20:31:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:19,324 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2021-02-21 20:31:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-21 20:31:19,325 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-21 20:31:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:19,329 INFO L225 Difference]: With dead ends: 281 [2021-02-21 20:31:19,329 INFO L226 Difference]: Without dead ends: 279 [2021-02-21 20:31:19,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2021-02-21 20:31:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-02-21 20:31:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 243. [2021-02-21 20:31:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2021-02-21 20:31:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 264 transitions. [2021-02-21 20:31:19,399 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 264 transitions. Word has length 78 [2021-02-21 20:31:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:19,400 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 264 transitions. [2021-02-21 20:31:19,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-21 20:31:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2021-02-21 20:31:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-02-21 20:31:19,402 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:19,402 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:19,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 20:31:19,403 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1871950108, now seen corresponding path program 1 times [2021-02-21 20:31:19,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:19,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1102352327] [2021-02-21 20:31:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:19,409 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,509 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,510 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,511 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,511 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,515 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,515 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,520 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,520 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,534 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,535 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-21 20:31:19,545 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,546 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-21 20:31:19,562 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,565 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-21 20:31:19,578 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,579 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-21 20:31:19,597 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,598 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:31:19,613 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,614 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:31:19,631 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,632 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:19,651 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:19,664 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,718 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,722 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,729 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,730 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 20:31:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,760 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,761 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-21 20:31:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,786 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,787 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-02-21 20:31:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,795 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,796 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-02-21 20:31:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,814 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,814 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-21 20:31:19,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1102352327] [2021-02-21 20:31:19,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:19,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-02-21 20:31:19,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986525777] [2021-02-21 20:31:19,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-02-21 20:31:19,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-02-21 20:31:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-02-21 20:31:19,836 INFO L87 Difference]: Start difference. First operand 243 states and 264 transitions. Second operand 16 states. [2021-02-21 20:31:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:21,366 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2021-02-21 20:31:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-21 20:31:21,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2021-02-21 20:31:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:21,369 INFO L225 Difference]: With dead ends: 257 [2021-02-21 20:31:21,369 INFO L226 Difference]: Without dead ends: 157 [2021-02-21 20:31:21,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-02-21 20:31:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-02-21 20:31:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2021-02-21 20:31:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-02-21 20:31:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2021-02-21 20:31:21,396 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 77 [2021-02-21 20:31:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:21,397 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2021-02-21 20:31:21,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-02-21 20:31:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2021-02-21 20:31:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-21 20:31:21,398 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:21,398 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:21,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 20:31:21,399 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash -177855180, now seen corresponding path program 2 times [2021-02-21 20:31:21,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:21,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2032740841] [2021-02-21 20:31:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:21,402 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,458 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,459 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,460 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,460 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,466 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,467 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,474 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,475 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,483 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,483 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,493 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,498 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,508 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,509 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,521 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,522 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,538 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,553 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,554 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,575 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,576 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,577 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,598 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,599 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,622 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,622 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,656 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,656 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,680 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,682 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,706 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,710 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,711 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,712 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,736 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,737 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,764 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,765 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,794 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,795 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,824 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,828 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,855 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,857 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,857 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,858 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:21,882 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,882 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:21,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,907 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,972 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,973 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,979 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,980 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:22,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 20:31:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:22,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:22,008 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:22,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-21 20:31:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:22,012 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:22,013 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:22,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-21 20:31:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:22,017 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:22,017 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:22,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-21 20:31:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:22,022 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:22,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:31:22,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2032740841] [2021-02-21 20:31:22,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:22,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-21 20:31:22,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765183065] [2021-02-21 20:31:22,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-21 20:31:22,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:22,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-21 20:31:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-21 20:31:22,048 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 25 states. [2021-02-21 20:31:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:25,374 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2021-02-21 20:31:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-02-21 20:31:25,375 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-21 20:31:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:25,377 INFO L225 Difference]: With dead ends: 180 [2021-02-21 20:31:25,377 INFO L226 Difference]: Without dead ends: 118 [2021-02-21 20:31:25,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=632, Invalid=3028, Unknown=0, NotChecked=0, Total=3660 [2021-02-21 20:31:25,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-02-21 20:31:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2021-02-21 20:31:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-02-21 20:31:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2021-02-21 20:31:25,396 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 99 [2021-02-21 20:31:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:25,396 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2021-02-21 20:31:25,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-21 20:31:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2021-02-21 20:31:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-21 20:31:25,397 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:25,398 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:25,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-21 20:31:25,398 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:25,399 INFO L82 PathProgramCache]: Analyzing trace with hash 852518516, now seen corresponding path program 3 times [2021-02-21 20:31:25,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:25,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552518471] [2021-02-21 20:31:25,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:25,401 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:25,457 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,458 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:25,458 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,459 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,471 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,479 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,488 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,488 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,497 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,498 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,509 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,509 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,522 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,523 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,537 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,538 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,553 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,553 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,570 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,571 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,572 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,572 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,591 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,610 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,611 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,631 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,632 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,652 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,653 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,674 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,675 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,676 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,676 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,698 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,699 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,723 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,723 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,749 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,774 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,775 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,803 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,804 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:25,805 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,805 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:25,826 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,826 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:25,849 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:25,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:25,900 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,900 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:25,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:25,904 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,904 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:25,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-21 20:31:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:25,931 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,932 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:25,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-21 20:31:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:25,936 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:25,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-21 20:31:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:25,940 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,941 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:25,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-21 20:31:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:25,945 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:25,946 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:31:25,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552518471] [2021-02-21 20:31:25,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:25,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-21 20:31:25,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812637540] [2021-02-21 20:31:25,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-21 20:31:25,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:25,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-21 20:31:25,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-21 20:31:25,971 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 25 states. [2021-02-21 20:31:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:28,920 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2021-02-21 20:31:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-21 20:31:28,921 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-21 20:31:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:28,922 INFO L225 Difference]: With dead ends: 125 [2021-02-21 20:31:28,922 INFO L226 Difference]: Without dead ends: 0 [2021-02-21 20:31:28,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=569, Invalid=2737, Unknown=0, NotChecked=0, Total=3306 [2021-02-21 20:31:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-21 20:31:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-21 20:31:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-21 20:31:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-21 20:31:28,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-02-21 20:31:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:28,925 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-21 20:31:28,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-21 20:31:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-21 20:31:28,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-21 20:31:28,925 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-21 20:31:28,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-21 20:31:31,599 WARN L202 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-21 20:31:31,764 WARN L202 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 29 [2021-02-21 20:31:31,981 WARN L202 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2021-02-21 20:31:32,173 WARN L202 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-21 20:31:32,509 WARN L202 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2021-02-21 20:31:32,768 WARN L202 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-21 20:31:33,017 WARN L202 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2021-02-21 20:31:33,304 WARN L202 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-21 20:31:33,649 WARN L202 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-02-21 20:31:33,848 WARN L202 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-21 20:31:34,078 WARN L202 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-21 20:31:34,360 WARN L202 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2021-02-21 20:31:34,597 WARN L202 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-21 20:31:34,858 WARN L202 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-02-21 20:31:35,053 WARN L202 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-21 20:31:35,336 WARN L202 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-21 20:31:35,567 WARN L202 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-21 20:31:35,776 WARN L202 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-21 20:31:36,077 WARN L202 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2021-02-21 20:31:36,233 WARN L202 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2021-02-21 20:31:36,394 WARN L202 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-21 20:31:36,644 WARN L202 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-21 20:31:36,940 WARN L202 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2021-02-21 20:31:37,140 WARN L202 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-21 20:31:37,426 WARN L202 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2021-02-21 20:31:37,693 WARN L202 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-02-21 20:31:37,892 WARN L202 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-21 20:31:38,164 WARN L202 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2021-02-21 20:31:38,455 WARN L202 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-21 20:31:38,616 WARN L202 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2021-02-21 20:31:38,911 WARN L202 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2021-02-21 20:31:39,130 WARN L202 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-21 20:31:39,382 WARN L202 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-21 20:31:39,584 WARN L202 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-21 20:31:39,844 WARN L202 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-21 20:31:40,108 WARN L202 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2021-02-21 20:31:40,386 WARN L202 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-21 20:31:40,610 WARN L202 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-21 20:31:40,840 WARN L202 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-21 20:31:40,844 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-02-21 20:31:40,844 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-02-21 20:31:40,844 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-02-21 20:31:40,845 INFO L192 CegarLoopUtils]: At program point L5-4(line 5) the Hoare annotation is: true [2021-02-21 20:31:40,845 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:31:40,845 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-21 20:31:40,845 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2021-02-21 20:31:40,845 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#t~string6.offset)| |#t~string6.offset|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string7.offset| |old(#t~string7.offset)|) (= |old(#t~string7.base)| |#t~string7.base|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:40,845 INFO L192 CegarLoopUtils]: At program point L5(line 5) the Hoare annotation is: true [2021-02-21 20:31:40,845 INFO L192 CegarLoopUtils]: At program point L5-1(line 5) the Hoare annotation is: true [2021-02-21 20:31:40,846 INFO L192 CegarLoopUtils]: At program point L5-2(line 5) the Hoare annotation is: true [2021-02-21 20:31:40,846 INFO L192 CegarLoopUtils]: At program point L5-3(line 5) the Hoare annotation is: true [2021-02-21 20:31:40,846 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:31:40,846 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:31:40,846 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:31:40,846 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-21 20:31:40,846 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-21 20:31:40,846 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2021-02-21 20:31:40,847 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-21 20:31:40,847 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-21 20:31:40,847 INFO L192 CegarLoopUtils]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2021-02-21 20:31:40,847 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2021-02-21 20:31:40,847 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 41 50) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:40,847 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 41 50) the Hoare annotation is: true [2021-02-21 20:31:40,847 INFO L192 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: true [2021-02-21 20:31:40,847 INFO L192 CegarLoopUtils]: At program point L48-1(line 48) the Hoare annotation is: true [2021-02-21 20:31:40,848 INFO L185 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-21 20:31:40,848 INFO L185 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-21 20:31:40,848 INFO L192 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: true [2021-02-21 20:31:40,848 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 41 50) the Hoare annotation is: true [2021-02-21 20:31:40,848 INFO L185 CegarLoopUtils]: At program point L44(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:40,848 INFO L185 CegarLoopUtils]: At program point L45-1(line 45) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc17.base|)) [2021-02-21 20:31:40,848 INFO L192 CegarLoopUtils]: At program point L46-2(line 46) the Hoare annotation is: true [2021-02-21 20:31:40,848 INFO L185 CegarLoopUtils]: At program point L44-1(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:40,848 INFO L192 CegarLoopUtils]: At program point L46-3(line 46) the Hoare annotation is: true [2021-02-21 20:31:40,848 INFO L185 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:40,849 INFO L185 CegarLoopUtils]: At program point L42-1(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:40,849 INFO L185 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,849 INFO L185 CegarLoopUtils]: At program point L35-2(line 35) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse8))) (.cse2 (= check_~ax~0 0)) (.cse3 (= |check_#t~mem15| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse8)) (.cse6 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse7 (+ check_~y 1))) (and .cse2 .cse3 (<= .cse7 |check_#in~n|) .cse4 (<= .cse7 check_~n) .cse5 .cse6)))))) [2021-02-21 20:31:40,849 INFO L185 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,849 INFO L192 CegarLoopUtils]: At program point checkENTRY(lines 16 39) the Hoare annotation is: true [2021-02-21 20:31:40,850 INFO L185 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,850 INFO L185 CegarLoopUtils]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 .cse4 (= check_~x 0))) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-21 20:31:40,850 INFO L185 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,850 INFO L185 CegarLoopUtils]: At program point L25-2(lines 25 26) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 (= |check_#t~mem9| 0) .cse4 (= check_~x 0)))))) [2021-02-21 20:31:40,851 INFO L185 CegarLoopUtils]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 (= |check_#t~mem9| 0) .cse4 (= check_~x 0)))))) [2021-02-21 20:31:40,851 INFO L185 CegarLoopUtils]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 .cse4 (= check_~x 0))) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-21 20:31:40,851 INFO L185 CegarLoopUtils]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,852 INFO L185 CegarLoopUtils]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (= |check_#t~post10| 0) .cse4 (= check_~x 0))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 .cse5 .cse1 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 1 check_~x)))))) [2021-02-21 20:31:40,852 INFO L185 CegarLoopUtils]: At program point L25-7(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (= |check_#t~post10| 0) .cse4 (<= 1 check_~x))) (or .cse0 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 2 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-21 20:31:40,852 INFO L185 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,852 INFO L185 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse2 (<= .cse7 |check_#in~n|)) (.cse3 (<= .cse7 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 (= (select |#memory_int| check_~a.base) .cse4) (<= 1 check_~x)) .cse5 .cse1) (or (and .cse2 .cse3 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-21 20:31:40,853 INFO L185 CegarLoopUtils]: At program point L25-9(line 25) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,853 INFO L185 CegarLoopUtils]: At program point L25-10(line 25) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,853 INFO L185 CegarLoopUtils]: At program point L25-11(lines 25 26) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse10 |check_#in~n|)) (.cse4 (<= .cse10 check_~n)) (.cse2 (<= 2 check_~x)) (.cse5 (= (select |#memory_int| check_~a.base) .cse9)) (.cse6 (<= 1 check_~x)) (.cse7 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse8 (<= (+ check_~y 2) check_~n))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 .cse6) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 .cse5 .cse2) .cse7 .cse1 (and .cse8 .cse5 .cse6)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse7 .cse1 .cse8)))) [2021-02-21 20:31:40,853 INFO L185 CegarLoopUtils]: At program point checkFINAL(lines 16 39) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,854 INFO L185 CegarLoopUtils]: At program point L36(line 36) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse2 (= check_~ax~0 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (<= 1 check_~x)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 .cse5) .cse1) (or (let ((.cse6 (+ check_~y 1))) (and .cse2 (<= .cse6 |check_#in~n|) .cse3 (<= .cse6 check_~n) .cse4 .cse5)) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,854 INFO L185 CegarLoopUtils]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) .cse1)))) [2021-02-21 20:31:40,854 INFO L185 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6))) (.cse2 (= |check_#t~mem14| 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse5 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (let ((.cse3 (+ check_~y 1))) (and .cse2 (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) .cse4 .cse5)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4 .cse5))))) [2021-02-21 20:31:40,854 INFO L185 CegarLoopUtils]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (= |check_#t~mem14| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse6 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse3 (+ check_~y 1))) (and .cse2 (<= .cse3 |check_#in~n|) .cse4 (<= .cse3 check_~n) .cse5 .cse6)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4 .cse5 .cse6))))) [2021-02-21 20:31:40,854 INFO L185 CegarLoopUtils]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,855 INFO L185 CegarLoopUtils]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,855 INFO L185 CegarLoopUtils]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,855 INFO L185 CegarLoopUtils]: At program point L28(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,855 INFO L185 CegarLoopUtils]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,856 INFO L185 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,856 INFO L185 CegarLoopUtils]: At program point L28-2(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,856 INFO L185 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 .cse2 .cse1 (let ((.cse4 (+ check_~y 1))) (and (<= (+ |check_#t~post11| 1) check_~n) (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (= (select |#memory_int| check_~a.base) .cse5) (<= 1 check_~x))))))) [2021-02-21 20:31:40,856 INFO L185 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and (<= (+ |check_#t~post11| 1) check_~n) (<= (+ check_~y 2) check_~n) (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)))))) [2021-02-21 20:31:40,857 INFO L185 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,857 INFO L185 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,857 INFO L185 CegarLoopUtils]: At program point checkEXIT(lines 16 39) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:40,857 INFO L185 CegarLoopUtils]: At program point L16(lines 16 39) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2021-02-21 20:31:40,857 INFO L185 CegarLoopUtils]: At program point L16-1(lines 16 39) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 (<= 1 check_~x)) .cse3 .cse1) (or .cse0 (and .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse3 .cse1 (<= (+ check_~y 2) |check_#in~n|)))) [2021-02-21 20:31:40,858 INFO L185 CegarLoopUtils]: At program point L16-2(lines 16 39) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse2 .cse3 (<= 1 check_~x)) .cse4 .cse1)))) [2021-02-21 20:31:40,858 INFO L185 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) .cse2 (<= .cse5 check_~n) .cse3 .cse4)))))) [2021-02-21 20:31:40,858 INFO L185 CegarLoopUtils]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem15| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse0 (let ((.cse6 (+ check_~y 1))) (and .cse2 (<= .cse6 |check_#in~n|) .cse3 (<= .cse6 check_~n) .cse4 .cse5)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:40,858 INFO L192 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2021-02-21 20:31:40,858 INFO L185 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-21 20:31:40,858 INFO L185 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-21 20:31:40,859 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-21 20:31:40,859 INFO L185 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-21 20:31:40,859 INFO L185 CegarLoopUtils]: At program point L11-4(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-21 20:31:40,859 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-21 20:31:40,859 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-21 20:31:40,859 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-21 20:31:40,859 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-21 20:31:40,877 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:558) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-02-21 20:31:40,879 INFO L168 Benchmark]: Toolchain (without parser) took 35455.79 ms. Allocated memory was 151.0 MB in the beginning and 320.9 MB in the end (delta: 169.9 MB). Free memory was 126.7 MB in the beginning and 278.7 MB in the end (delta: -152.0 MB). Peak memory consumption was 187.0 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:40,879 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 151.0 MB. Free memory is still 125.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 20:31:40,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.09 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 115.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:40,880 INFO L168 Benchmark]: Boogie Preprocessor took 50.57 ms. Allocated memory is still 151.0 MB. Free memory was 115.6 MB in the beginning and 114.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:40,880 INFO L168 Benchmark]: RCFGBuilder took 649.29 ms. Allocated memory is still 151.0 MB. Free memory was 114.0 MB in the beginning and 125.0 MB in the end (delta: -11.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:40,880 INFO L168 Benchmark]: TraceAbstraction took 34396.74 ms. Allocated memory was 151.0 MB in the beginning and 320.9 MB in the end (delta: 169.9 MB). Free memory was 124.4 MB in the beginning and 278.7 MB in the end (delta: -154.3 MB). Peak memory consumption was 185.0 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:40,881 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 151.0 MB. Free memory is still 125.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 331.09 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 115.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 50.57 ms. Allocated memory is still 151.0 MB. Free memory was 115.6 MB in the beginning and 114.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 649.29 ms. Allocated memory is still 151.0 MB. Free memory was 114.0 MB in the beginning and 125.0 MB in the end (delta: -11.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 34396.74 ms. Allocated memory was 151.0 MB in the beginning and 320.9 MB in the end (delta: 169.9 MB). Free memory was 124.4 MB in the beginning and 278.7 MB in the end (delta: -154.3 MB). Peak memory consumption was 185.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 41]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 10]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...