/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/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-21 20:33:22,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 20:33:22,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 20:33:22,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 20:33:22,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 20:33:22,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 20:33:22,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 20:33:22,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 20:33:22,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 20:33:22,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 20:33:22,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 20:33:22,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 20:33:22,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 20:33:22,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 20:33:22,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 20:33:22,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 20:33:22,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 20:33:22,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 20:33:22,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 20:33:22,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 20:33:22,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 20:33:22,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 20:33:22,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 20:33:22,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 20:33:22,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 20:33:22,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 20:33:22,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 20:33:22,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 20:33:22,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 20:33:22,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 20:33:22,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 20:33:22,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 20:33:22,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 20:33:22,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 20:33:22,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 20:33:22,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 20:33:22,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 20:33:22,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 20:33:22,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 20:33:22,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 20:33:22,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 20:33:22,916 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:33:22,941 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 20:33:22,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 20:33:22,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 20:33:22,946 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 20:33:22,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 20:33:22,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 20:33:22,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 20:33:22,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 20:33:22,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 20:33:22,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 20:33:22,948 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 20:33:22,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 20:33:22,948 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 20:33:22,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 20:33:22,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 20:33:22,949 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-21 20:33:22,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-21 20:33:22,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 20:33:22,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 20:33:22,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 20:33:22,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-21 20:33:22,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 20:33:22,953 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:33:23,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 20:33:23,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 20:33:23,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 20:33:23,414 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 20:33:23,414 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 20:33:23,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2021-02-21 20:33:23,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbbd6010/48d87915e12447079745681df1dd1c28/FLAG7fa6955bf [2021-02-21 20:33:24,151 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 20:33:24,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2021-02-21 20:33:24,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbbd6010/48d87915e12447079745681df1dd1c28/FLAG7fa6955bf [2021-02-21 20:33:24,526 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dbbd6010/48d87915e12447079745681df1dd1c28 [2021-02-21 20:33:24,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 20:33:24,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 20:33:24,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 20:33:24,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 20:33:24,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 20:33:24,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:33:24" (1/1) ... [2021-02-21 20:33:24,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e61d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24, skipping insertion in model container [2021-02-21 20:33:24,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:33:24" (1/1) ... [2021-02-21 20:33:24,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 20:33:24,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 20:33:24,814 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2021-02-21 20:33:24,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:33:24,831 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 20:33:24,858 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2021-02-21 20:33:24,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:33:24,876 INFO L208 MainTranslator]: Completed translation [2021-02-21 20:33:24,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24 WrapperNode [2021-02-21 20:33:24,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 20:33:24,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 20:33:24,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 20:33:24,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 20:33:24,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24" (1/1) ... [2021-02-21 20:33:24,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24" (1/1) ... [2021-02-21 20:33:24,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24" (1/1) ... [2021-02-21 20:33:24,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24" (1/1) ... [2021-02-21 20:33:24,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24" (1/1) ... [2021-02-21 20:33:24,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24" (1/1) ... [2021-02-21 20:33:24,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24" (1/1) ... [2021-02-21 20:33:24,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 20:33:24,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 20:33:24,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 20:33:24,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 20:33:24,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24" (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:33:25,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 20:33:25,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 20:33:25,049 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 20:33:25,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 20:33:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 20:33:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 20:33:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 20:33:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 20:33:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-21 20:33:25,051 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 20:33:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 20:33:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 20:33:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 20:33:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 20:33:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 20:33:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 20:33:25,645 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 20:33:25,646 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-02-21 20:33:25,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:33:25 BoogieIcfgContainer [2021-02-21 20:33:25,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 20:33:25,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 20:33:25,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 20:33:25,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 20:33:25,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 08:33:24" (1/3) ... [2021-02-21 20:33:25,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599d6fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:33:25, skipping insertion in model container [2021-02-21 20:33:25,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:33:24" (2/3) ... [2021-02-21 20:33:25,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599d6fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:33:25, skipping insertion in model container [2021-02-21 20:33:25,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:33:25" (3/3) ... [2021-02-21 20:33:25,669 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2021-02-21 20:33:25,680 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-21 20:33:25,689 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 20:33:25,717 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 20:33:25,754 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 20:33:25,755 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 20:33:25,755 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-21 20:33:25,755 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 20:33:25,755 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 20:33:25,756 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 20:33:25,756 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 20:33:25,756 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 20:33:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2021-02-21 20:33:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-21 20:33:25,808 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:25,810 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, 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:33:25,810 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:25,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1595121597, now seen corresponding path program 1 times [2021-02-21 20:33:25,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:25,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [266893714] [2021-02-21 20:33:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:25,950 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:26,215 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:26,217 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:26,218 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:26,220 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:26,239 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:26,240 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:26,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:26,292 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:26,293 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:26,325 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:33:26,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [266893714] [2021-02-21 20:33:26,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:26,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:26,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360086656] [2021-02-21 20:33:26,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:26,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:26,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:26,358 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2021-02-21 20:33:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:26,963 INFO L93 Difference]: Finished difference Result 222 states and 300 transitions. [2021-02-21 20:33:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:26,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-21 20:33:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:26,990 INFO L225 Difference]: With dead ends: 222 [2021-02-21 20:33:26,991 INFO L226 Difference]: Without dead ends: 152 [2021-02-21 20:33:27,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-02-21 20:33:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2021-02-21 20:33:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-02-21 20:33:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2021-02-21 20:33:27,081 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 69 [2021-02-21 20:33:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:27,082 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2021-02-21 20:33:27,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2021-02-21 20:33:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 20:33:27,085 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:27,085 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, 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:33:27,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 20:33:27,086 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:27,087 INFO L82 PathProgramCache]: Analyzing trace with hash 399834427, now seen corresponding path program 1 times [2021-02-21 20:33:27,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:27,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1786704921] [2021-02-21 20:33:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:27,091 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:27,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:27,169 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:27,172 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:27,173 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:27,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:27,181 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:27,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:27,216 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:27,217 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:27,225 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:33:27,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1786704921] [2021-02-21 20:33:27,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:27,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:27,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844626004] [2021-02-21 20:33:27,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:27,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:27,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:27,230 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand 4 states. [2021-02-21 20:33:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:27,561 INFO L93 Difference]: Finished difference Result 181 states and 237 transitions. [2021-02-21 20:33:27,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:27,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-02-21 20:33:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:27,565 INFO L225 Difference]: With dead ends: 181 [2021-02-21 20:33:27,565 INFO L226 Difference]: Without dead ends: 179 [2021-02-21 20:33:27,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-02-21 20:33:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2021-02-21 20:33:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-02-21 20:33:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2021-02-21 20:33:27,612 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 70 [2021-02-21 20:33:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:27,612 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2021-02-21 20:33:27,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2021-02-21 20:33:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-21 20:33:27,615 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:27,615 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, 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:33:27,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 20:33:27,616 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:27,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2091082677, now seen corresponding path program 1 times [2021-02-21 20:33:27,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:27,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178007252] [2021-02-21 20:33:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:27,621 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:27,681 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:27,686 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:27,687 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:27,688 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:27,691 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:27,692 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:27,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:27,747 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:27,750 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:27,762 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:33:27,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178007252] [2021-02-21 20:33:27,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:27,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:27,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054183032] [2021-02-21 20:33:27,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:27,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:27,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:27,767 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand 4 states. [2021-02-21 20:33:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:28,049 INFO L93 Difference]: Finished difference Result 354 states and 481 transitions. [2021-02-21 20:33:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:28,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-02-21 20:33:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:28,053 INFO L225 Difference]: With dead ends: 354 [2021-02-21 20:33:28,054 INFO L226 Difference]: Without dead ends: 249 [2021-02-21 20:33:28,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-02-21 20:33:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2021-02-21 20:33:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2021-02-21 20:33:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 328 transitions. [2021-02-21 20:33:28,150 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 328 transitions. Word has length 70 [2021-02-21 20:33:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:28,151 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 328 transitions. [2021-02-21 20:33:28,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 328 transitions. [2021-02-21 20:33:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-02-21 20:33:28,153 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:28,153 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, 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:33:28,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 20:33:28,154 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1296567304, now seen corresponding path program 1 times [2021-02-21 20:33:28,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:28,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1603008052] [2021-02-21 20:33:28,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:28,158 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:28,203 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:28,204 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:28,205 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:28,205 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:28,209 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:28,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:28,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:28,249 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:28,250 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:28,284 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:33:28,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1603008052] [2021-02-21 20:33:28,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:28,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:28,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905251348] [2021-02-21 20:33:28,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:28,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:28,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:28,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:28,288 INFO L87 Difference]: Start difference. First operand 247 states and 328 transitions. Second operand 4 states. [2021-02-21 20:33:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:28,584 INFO L93 Difference]: Finished difference Result 301 states and 404 transitions. [2021-02-21 20:33:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:28,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-02-21 20:33:28,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:28,589 INFO L225 Difference]: With dead ends: 301 [2021-02-21 20:33:28,589 INFO L226 Difference]: Without dead ends: 299 [2021-02-21 20:33:28,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-02-21 20:33:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2021-02-21 20:33:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2021-02-21 20:33:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 326 transitions. [2021-02-21 20:33:28,637 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 326 transitions. Word has length 71 [2021-02-21 20:33:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:28,638 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 326 transitions. [2021-02-21 20:33:28,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2021-02-21 20:33:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-02-21 20:33:28,644 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:28,644 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, 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:33:28,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 20:33:28,645 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:28,646 INFO L82 PathProgramCache]: Analyzing trace with hash 399298551, now seen corresponding path program 1 times [2021-02-21 20:33:28,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:28,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2042870597] [2021-02-21 20:33:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:28,651 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:28,722 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:28,723 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:28,724 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:28,724 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:28,729 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:28,729 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:28,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:28,764 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:28,765 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:28,771 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:33:28,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2042870597] [2021-02-21 20:33:28,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:28,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:28,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954878876] [2021-02-21 20:33:28,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:28,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:28,775 INFO L87 Difference]: Start difference. First operand 247 states and 326 transitions. Second operand 4 states. [2021-02-21 20:33:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:29,110 INFO L93 Difference]: Finished difference Result 639 states and 872 transitions. [2021-02-21 20:33:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:29,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-02-21 20:33:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:29,118 INFO L225 Difference]: With dead ends: 639 [2021-02-21 20:33:29,119 INFO L226 Difference]: Without dead ends: 437 [2021-02-21 20:33:29,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:29,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-02-21 20:33:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2021-02-21 20:33:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2021-02-21 20:33:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 582 transitions. [2021-02-21 20:33:29,210 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 582 transitions. Word has length 71 [2021-02-21 20:33:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:29,211 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 582 transitions. [2021-02-21 20:33:29,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 582 transitions. [2021-02-21 20:33:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-02-21 20:33:29,214 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:29,214 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, 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:33:29,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 20:33:29,215 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1949554255, now seen corresponding path program 1 times [2021-02-21 20:33:29,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:29,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1422049617] [2021-02-21 20:33:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:29,219 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:29,284 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:29,285 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:29,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:29,286 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:29,290 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:29,290 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:29,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:29,321 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:29,322 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:29,327 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:33:29,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1422049617] [2021-02-21 20:33:29,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:29,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:29,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125358596] [2021-02-21 20:33:29,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:29,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:29,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:29,329 INFO L87 Difference]: Start difference. First operand 435 states and 582 transitions. Second operand 4 states. [2021-02-21 20:33:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:29,657 INFO L93 Difference]: Finished difference Result 531 states and 716 transitions. [2021-02-21 20:33:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:29,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-02-21 20:33:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:29,661 INFO L225 Difference]: With dead ends: 531 [2021-02-21 20:33:29,662 INFO L226 Difference]: Without dead ends: 529 [2021-02-21 20:33:29,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-02-21 20:33:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 435. [2021-02-21 20:33:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2021-02-21 20:33:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 578 transitions. [2021-02-21 20:33:29,730 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 578 transitions. Word has length 72 [2021-02-21 20:33:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:29,730 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 578 transitions. [2021-02-21 20:33:29,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 578 transitions. [2021-02-21 20:33:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-02-21 20:33:29,731 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:29,732 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, 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:33:29,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 20:33:29,732 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:29,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:29,733 INFO L82 PathProgramCache]: Analyzing trace with hash -506401431, now seen corresponding path program 1 times [2021-02-21 20:33:29,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:29,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [315277361] [2021-02-21 20:33:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:29,735 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:29,761 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:29,762 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:29,763 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:29,763 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:29,767 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:29,767 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:29,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:29,798 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:29,799 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:29,803 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:33:29,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [315277361] [2021-02-21 20:33:29,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:29,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:29,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986481048] [2021-02-21 20:33:29,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:29,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:29,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:29,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:29,806 INFO L87 Difference]: Start difference. First operand 435 states and 578 transitions. Second operand 4 states. [2021-02-21 20:33:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:30,214 INFO L93 Difference]: Finished difference Result 1191 states and 1612 transitions. [2021-02-21 20:33:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:30,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-02-21 20:33:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:30,219 INFO L225 Difference]: With dead ends: 1191 [2021-02-21 20:33:30,220 INFO L226 Difference]: Without dead ends: 801 [2021-02-21 20:33:30,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-02-21 20:33:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2021-02-21 20:33:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2021-02-21 20:33:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1062 transitions. [2021-02-21 20:33:30,344 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1062 transitions. Word has length 72 [2021-02-21 20:33:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:30,344 INFO L480 AbstractCegarLoop]: Abstraction has 799 states and 1062 transitions. [2021-02-21 20:33:30,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1062 transitions. [2021-02-21 20:33:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-02-21 20:33:30,346 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:30,346 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, 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:33:30,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-21 20:33:30,347 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1481670571, now seen corresponding path program 1 times [2021-02-21 20:33:30,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:30,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1300719498] [2021-02-21 20:33:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:30,350 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:30,400 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:30,401 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:30,402 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:30,402 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:30,406 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:30,407 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:30,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:30,436 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:30,437 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:30,442 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:33:30,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1300719498] [2021-02-21 20:33:30,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:30,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:30,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145180351] [2021-02-21 20:33:30,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:30,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:30,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:30,445 INFO L87 Difference]: Start difference. First operand 799 states and 1062 transitions. Second operand 4 states. [2021-02-21 20:33:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:30,936 INFO L93 Difference]: Finished difference Result 2259 states and 3032 transitions. [2021-02-21 20:33:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:30,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-02-21 20:33:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:30,946 INFO L225 Difference]: With dead ends: 2259 [2021-02-21 20:33:30,946 INFO L226 Difference]: Without dead ends: 1505 [2021-02-21 20:33:30,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2021-02-21 20:33:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2021-02-21 20:33:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2021-02-21 20:33:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1982 transitions. [2021-02-21 20:33:31,235 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1982 transitions. Word has length 73 [2021-02-21 20:33:31,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:31,236 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1982 transitions. [2021-02-21 20:33:31,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1982 transitions. [2021-02-21 20:33:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-02-21 20:33:31,239 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:31,239 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, 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:33:31,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-21 20:33:31,240 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:31,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash -499892148, now seen corresponding path program 1 times [2021-02-21 20:33:31,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:31,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [194921507] [2021-02-21 20:33:31,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:31,244 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:31,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:31,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:31,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:31,270 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:31,273 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:31,274 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:31,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:31,307 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:31,308 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:31,313 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:33:31,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [194921507] [2021-02-21 20:33:31,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:31,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:31,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785992779] [2021-02-21 20:33:31,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:31,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:31,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:31,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:31,316 INFO L87 Difference]: Start difference. First operand 1503 states and 1982 transitions. Second operand 4 states. [2021-02-21 20:33:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:31,881 INFO L93 Difference]: Finished difference Result 1827 states and 2416 transitions. [2021-02-21 20:33:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:31,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-02-21 20:33:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:31,892 INFO L225 Difference]: With dead ends: 1827 [2021-02-21 20:33:31,892 INFO L226 Difference]: Without dead ends: 1825 [2021-02-21 20:33:31,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2021-02-21 20:33:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1503. [2021-02-21 20:33:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2021-02-21 20:33:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1966 transitions. [2021-02-21 20:33:32,142 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1966 transitions. Word has length 73 [2021-02-21 20:33:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:32,143 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1966 transitions. [2021-02-21 20:33:32,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1966 transitions. [2021-02-21 20:33:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-02-21 20:33:32,145 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:32,145 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, 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:33:32,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-21 20:33:32,146 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash 876681059, now seen corresponding path program 1 times [2021-02-21 20:33:32,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:32,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [926898460] [2021-02-21 20:33:32,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:32,150 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:32,192 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:32,192 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:32,195 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:32,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:32,199 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:32,199 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:32,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:32,229 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:32,230 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:32,236 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:33:32,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [926898460] [2021-02-21 20:33:32,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:32,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:32,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920056633] [2021-02-21 20:33:32,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:32,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:32,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:32,239 INFO L87 Difference]: Start difference. First operand 1503 states and 1966 transitions. Second operand 4 states. [2021-02-21 20:33:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:32,789 INFO L93 Difference]: Finished difference Result 1811 states and 2368 transitions. [2021-02-21 20:33:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:32,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-02-21 20:33:32,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:32,801 INFO L225 Difference]: With dead ends: 1811 [2021-02-21 20:33:32,802 INFO L226 Difference]: Without dead ends: 1809 [2021-02-21 20:33:32,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2021-02-21 20:33:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1503. [2021-02-21 20:33:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2021-02-21 20:33:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1950 transitions. [2021-02-21 20:33:33,053 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1950 transitions. Word has length 74 [2021-02-21 20:33:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:33,054 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1950 transitions. [2021-02-21 20:33:33,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1950 transitions. [2021-02-21 20:33:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-02-21 20:33:33,057 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:33,057 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, 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:33:33,057 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-21 20:33:33,058 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:33,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1312606435, now seen corresponding path program 1 times [2021-02-21 20:33:33,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:33,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [976166879] [2021-02-21 20:33:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:33,061 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:33,086 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:33,087 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:33,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:33,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:33,092 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:33,093 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:33,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:33,124 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:33,125 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:33,131 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:33:33,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [976166879] [2021-02-21 20:33:33,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:33,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:33,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915713231] [2021-02-21 20:33:33,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:33,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:33,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:33,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:33,134 INFO L87 Difference]: Start difference. First operand 1503 states and 1950 transitions. Second operand 4 states. [2021-02-21 20:33:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:33,948 INFO L93 Difference]: Finished difference Result 4323 states and 5632 transitions. [2021-02-21 20:33:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:33,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-02-21 20:33:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:33,968 INFO L225 Difference]: With dead ends: 4323 [2021-02-21 20:33:33,968 INFO L226 Difference]: Without dead ends: 2865 [2021-02-21 20:33:33,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2021-02-21 20:33:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2863. [2021-02-21 20:33:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2863 states. [2021-02-21 20:33:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2863 states and 3662 transitions. [2021-02-21 20:33:34,557 INFO L78 Accepts]: Start accepts. Automaton has 2863 states and 3662 transitions. Word has length 74 [2021-02-21 20:33:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:34,557 INFO L480 AbstractCegarLoop]: Abstraction has 2863 states and 3662 transitions. [2021-02-21 20:33:34,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3662 transitions. [2021-02-21 20:33:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-02-21 20:33:34,562 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:34,562 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, 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:33:34,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-21 20:33:34,563 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:34,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2035847329, now seen corresponding path program 1 times [2021-02-21 20:33:34,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:34,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [369825543] [2021-02-21 20:33:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:34,567 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:34,589 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:34,590 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:34,591 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:34,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:34,596 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:34,597 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:34,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:34,640 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:34,641 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:34,648 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:33:34,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [369825543] [2021-02-21 20:33:34,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:34,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:34,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118549675] [2021-02-21 20:33:34,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:34,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:34,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:34,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:34,651 INFO L87 Difference]: Start difference. First operand 2863 states and 3662 transitions. Second operand 4 states. [2021-02-21 20:33:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:35,755 INFO L93 Difference]: Finished difference Result 8307 states and 10640 transitions. [2021-02-21 20:33:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:35,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-02-21 20:33:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:35,783 INFO L225 Difference]: With dead ends: 8307 [2021-02-21 20:33:35,784 INFO L226 Difference]: Without dead ends: 5489 [2021-02-21 20:33:35,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2021-02-21 20:33:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5487. [2021-02-21 20:33:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2021-02-21 20:33:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 6894 transitions. [2021-02-21 20:33:36,667 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 6894 transitions. Word has length 75 [2021-02-21 20:33:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:36,667 INFO L480 AbstractCegarLoop]: Abstraction has 5487 states and 6894 transitions. [2021-02-21 20:33:36,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 6894 transitions. [2021-02-21 20:33:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-02-21 20:33:36,672 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:36,672 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, 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:33:36,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-21 20:33:36,673 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:36,674 INFO L82 PathProgramCache]: Analyzing trace with hash 600777888, now seen corresponding path program 1 times [2021-02-21 20:33:36,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:36,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [324580360] [2021-02-21 20:33:36,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:36,679 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:36,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:36,708 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:36,709 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:36,709 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:36,712 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:36,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:36,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:36,744 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:36,745 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:36,751 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:33:36,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [324580360] [2021-02-21 20:33:36,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:36,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:36,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503585393] [2021-02-21 20:33:36,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:36,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:36,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:36,753 INFO L87 Difference]: Start difference. First operand 5487 states and 6894 transitions. Second operand 4 states. [2021-02-21 20:33:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:38,222 INFO L93 Difference]: Finished difference Result 6515 states and 8112 transitions. [2021-02-21 20:33:38,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:38,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-02-21 20:33:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:38,257 INFO L225 Difference]: With dead ends: 6515 [2021-02-21 20:33:38,257 INFO L226 Difference]: Without dead ends: 6513 [2021-02-21 20:33:38,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2021-02-21 20:33:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 5487. [2021-02-21 20:33:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2021-02-21 20:33:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 6830 transitions. [2021-02-21 20:33:39,154 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 6830 transitions. Word has length 75 [2021-02-21 20:33:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:39,154 INFO L480 AbstractCegarLoop]: Abstraction has 5487 states and 6830 transitions. [2021-02-21 20:33:39,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 6830 transitions. [2021-02-21 20:33:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-02-21 20:33:39,160 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:39,160 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, 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:33:39,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-21 20:33:39,161 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash 637714551, now seen corresponding path program 1 times [2021-02-21 20:33:39,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:39,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1051276291] [2021-02-21 20:33:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:39,165 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:39,189 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:39,189 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:39,190 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:39,191 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:39,195 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:39,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:39,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:39,227 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:39,228 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:39,238 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:33:39,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1051276291] [2021-02-21 20:33:39,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:39,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:39,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741342779] [2021-02-21 20:33:39,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:39,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:39,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:39,241 INFO L87 Difference]: Start difference. First operand 5487 states and 6830 transitions. Second operand 4 states. [2021-02-21 20:33:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:41,001 INFO L93 Difference]: Finished difference Result 6451 states and 7920 transitions. [2021-02-21 20:33:41,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:41,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-02-21 20:33:41,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:41,033 INFO L225 Difference]: With dead ends: 6451 [2021-02-21 20:33:41,034 INFO L226 Difference]: Without dead ends: 6449 [2021-02-21 20:33:41,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6449 states. [2021-02-21 20:33:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6449 to 5487. [2021-02-21 20:33:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2021-02-21 20:33:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 6766 transitions. [2021-02-21 20:33:41,874 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 6766 transitions. Word has length 76 [2021-02-21 20:33:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:41,875 INFO L480 AbstractCegarLoop]: Abstraction has 5487 states and 6766 transitions. [2021-02-21 20:33:41,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 6766 transitions. [2021-02-21 20:33:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-02-21 20:33:41,880 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:41,880 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, 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:33:41,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-21 20:33:41,881 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1313489105, now seen corresponding path program 1 times [2021-02-21 20:33:41,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:41,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2085099504] [2021-02-21 20:33:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:41,884 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:41,964 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:41,965 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:41,966 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:41,966 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:41,970 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:41,970 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:41,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:42,000 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:42,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:42,008 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:33:42,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2085099504] [2021-02-21 20:33:42,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:42,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:42,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203791594] [2021-02-21 20:33:42,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:42,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:42,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:42,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:42,011 INFO L87 Difference]: Start difference. First operand 5487 states and 6766 transitions. Second operand 4 states. [2021-02-21 20:33:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:43,634 INFO L93 Difference]: Finished difference Result 15985 states and 19695 transitions. [2021-02-21 20:33:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:43,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-02-21 20:33:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:43,654 INFO L225 Difference]: With dead ends: 15985 [2021-02-21 20:33:43,655 INFO L226 Difference]: Without dead ends: 5487 [2021-02-21 20:33:43,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5487 states. [2021-02-21 20:33:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5487 to 5487. [2021-02-21 20:33:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2021-02-21 20:33:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 6510 transitions. [2021-02-21 20:33:44,360 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 6510 transitions. Word has length 76 [2021-02-21 20:33:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:44,361 INFO L480 AbstractCegarLoop]: Abstraction has 5487 states and 6510 transitions. [2021-02-21 20:33:44,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 6510 transitions. [2021-02-21 20:33:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-02-21 20:33:44,376 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:33:44,376 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, 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:33:44,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-02-21 20:33:44,377 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:33:44,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:33:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1782751476, now seen corresponding path program 1 times [2021-02-21 20:33:44,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:33:44,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105696474] [2021-02-21 20:33:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:33:44,380 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:33:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:44,400 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:44,401 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:44,402 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:44,402 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:33:44,406 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:44,406 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:44,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:33:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:33:44,437 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:33:44,438 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:33:44,448 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:33:44,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105696474] [2021-02-21 20:33:44,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:33:44,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:33:44,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643174240] [2021-02-21 20:33:44,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:33:44,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:33:44,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:33:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:33:44,451 INFO L87 Difference]: Start difference. First operand 5487 states and 6510 transitions. Second operand 4 states. [2021-02-21 20:33:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:33:45,406 INFO L93 Difference]: Finished difference Result 5487 states and 6510 transitions. [2021-02-21 20:33:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-21 20:33:45,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-02-21 20:33:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:33:45,408 INFO L225 Difference]: With dead ends: 5487 [2021-02-21 20:33:45,408 INFO L226 Difference]: Without dead ends: 0 [2021-02-21 20:33:45,431 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:33:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-21 20:33:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-21 20:33:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-21 20:33:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-21 20:33:45,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2021-02-21 20:33:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:33:45,433 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-21 20:33:45,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:33:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-21 20:33:45,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-21 20:33:45,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-02-21 20:33:45,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-21 20:33:48,368 WARN L202 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 820 DAG size of output: 31 [2021-02-21 20:33:48,497 WARN L202 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 39 [2021-02-21 20:33:50,077 WARN L202 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 820 DAG size of output: 31 [2021-02-21 20:33:51,494 WARN L202 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 820 DAG size of output: 31 [2021-02-21 20:33:51,646 WARN L202 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 31 [2021-02-21 20:33:51,925 WARN L202 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 85 [2021-02-21 20:33:52,041 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 55 [2021-02-21 20:33:52,467 WARN L202 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 404 DAG size of output: 41 [2021-02-21 20:33:52,614 WARN L202 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 53 [2021-02-21 20:33:53,638 WARN L202 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 807 DAG size of output: 31 [2021-02-21 20:33:53,817 WARN L202 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2021-02-21 20:33:54,018 WARN L202 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 85 [2021-02-21 20:33:54,373 WARN L202 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 499 DAG size of output: 31 [2021-02-21 20:33:54,631 WARN L202 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 390 DAG size of output: 65 [2021-02-21 20:33:54,803 WARN L202 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 47 [2021-02-21 20:33:55,227 WARN L202 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 692 DAG size of output: 34 [2021-02-21 20:33:55,739 WARN L202 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 189 [2021-02-21 20:33:56,147 WARN L202 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-02-21 20:33:56,252 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2021-02-21 20:33:57,171 WARN L202 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 793 DAG size of output: 31 [2021-02-21 20:33:57,541 WARN L202 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 438 DAG size of output: 53 [2021-02-21 20:33:57,884 WARN L202 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 404 DAG size of output: 41 [2021-02-21 20:33:58,305 WARN L202 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-02-21 20:33:58,475 WARN L202 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2021-02-21 20:33:59,907 WARN L202 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 820 DAG size of output: 31 [2021-02-21 20:34:00,727 WARN L202 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 630 DAG size of output: 45 [2021-02-21 20:34:01,149 WARN L202 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 692 DAG size of output: 34 [2021-02-21 20:34:01,298 WARN L202 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 65 [2021-02-21 20:34:02,579 WARN L202 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 820 DAG size of output: 31 [2021-02-21 20:34:03,372 WARN L202 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 743 DAG size of output: 31 [2021-02-21 20:34:03,940 WARN L202 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 189 [2021-02-21 20:34:04,119 WARN L202 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2021-02-21 20:34:04,529 WARN L202 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 121 [2021-02-21 20:34:06,068 WARN L202 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 822 DAG size of output: 39 [2021-02-21 20:34:07,206 WARN L202 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 815 DAG size of output: 31 [2021-02-21 20:34:08,215 WARN L202 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 321 [2021-02-21 20:34:08,541 WARN L202 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 121 [2021-02-21 20:34:08,856 WARN L202 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 47 [2021-02-21 20:34:09,493 WARN L202 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 693 DAG size of output: 31 [2021-02-21 20:34:09,651 WARN L202 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2021-02-21 20:34:09,947 WARN L202 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-02-21 20:34:11,216 WARN L202 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 820 DAG size of output: 31 [2021-02-21 20:34:12,487 WARN L202 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-21 20:34:12,766 WARN L202 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-21 20:34:13,094 WARN L202 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-21 20:34:16,909 WARN L202 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-21 20:34:18,276 WARN L202 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-21 20:34:18,907 WARN L202 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-21 20:34:19,047 WARN L202 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-21 20:34:27,806 WARN L202 SmtUtils]: Spent 8.73 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2021-02-21 20:34:28,050 WARN L202 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-21 20:34:37,517 WARN L202 SmtUtils]: Spent 9.46 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2021-02-21 20:34:38,981 WARN L202 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-21 20:34:40,253 WARN L202 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-21 20:34:40,490 WARN L202 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-21 20:34:48,969 WARN L202 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2021-02-21 20:34:52,626 WARN L202 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-21 20:34:53,292 WARN L202 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-21 20:34:53,414 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-21 20:34:53,535 WARN L202 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-21 20:34:54,135 WARN L202 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-21 20:35:02,608 WARN L202 SmtUtils]: Spent 8.46 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2021-02-21 20:35:04,124 WARN L202 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-21 20:35:04,402 WARN L202 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-21 20:35:07,589 WARN L202 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-21 20:35:07,703 WARN L202 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-21 20:35:33,261 WARN L202 SmtUtils]: Spent 25.48 s on a formula simplification. DAG size of input: 311 DAG size of output: 291 [2021-02-21 20:35:36,624 WARN L202 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-21 20:35:37,200 WARN L202 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-21 20:35:37,858 WARN L202 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-21 20:35:37,997 WARN L202 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-21 20:35:41,358 WARN L202 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-21 20:35:51,008 WARN L202 SmtUtils]: Spent 9.65 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2021-02-21 20:35:51,017 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-21 20:35:51,017 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-21 20:35:51,017 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-21 20:35:51,018 INFO L192 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: true [2021-02-21 20:35:51,018 INFO L192 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: true [2021-02-21 20:35:51,018 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:35:51,018 INFO L192 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: true [2021-02-21 20:35:51,018 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-21 20:35:51,019 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2021-02-21 20:35:51,019 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:35:51,021 INFO L192 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: true [2021-02-21 20:35:51,021 INFO L192 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: true [2021-02-21 20:35:51,021 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:35:51,021 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:35:51,022 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:35:51,022 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-21 20:35:51,022 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-21 20:35:51,022 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2021-02-21 20:35:51,022 INFO L185 CegarLoopUtils]: At program point L118(line 118) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 .cse3 .cse4))) [2021-02-21 20:35:51,022 INFO L192 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: true [2021-02-21 20:35:51,023 INFO L185 CegarLoopUtils]: At program point L135(line 135) the Hoare annotation is: false [2021-02-21 20:35:51,023 INFO L185 CegarLoopUtils]: At program point L102-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse1 (= main_~p8~0 0)) (.cse6 (= main_~lk6~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~p5~0 0)) (.cse7 (= main_~lk8~0 1)) (.cse3 (= main_~p4~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse0 .cse9 .cse7 .cse3 .cse8) (and .cse9 .cse6 .cse7 .cse3 .cse8) (and .cse5 .cse0 .cse2 .cse7 .cse4) (and .cse5 .cse9 .cse6 .cse7 .cse8) (and .cse1 .cse6 .cse3 .cse8 .cse4) (and .cse1 .cse9 .cse6 .cse3 .cse8) (and .cse5 .cse0 .cse9 .cse7 .cse8) (and .cse0 .cse7 .cse3 .cse8 .cse4) (and .cse5 .cse2 .cse9 .cse6 .cse7) (and .cse2 .cse6 .cse7 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse9) (and .cse5 .cse0 .cse1 .cse9 .cse8) (and .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse0 .cse2 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse8 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse2 .cse9 .cse7 .cse3) (and .cse1 .cse2 .cse9 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse2 .cse6 .cse7 .cse4) (and .cse5 .cse1 .cse9 .cse6 .cse8) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse2 .cse9 .cse6 .cse7 .cse3) (and .cse5 .cse1 .cse2 .cse9 .cse6) (and .cse5 .cse0 .cse7 .cse8 .cse4) (and .cse6 .cse7 .cse3 .cse8 .cse4) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4))) [2021-02-21 20:35:51,023 INFO L192 CegarLoopUtils]: At program point L36(line 36) the Hoare annotation is: true [2021-02-21 20:35:51,023 INFO L192 CegarLoopUtils]: At program point L36-1(line 36) the Hoare annotation is: true [2021-02-21 20:35:51,024 INFO L192 CegarLoopUtils]: At program point L36-2(line 36) the Hoare annotation is: true [2021-02-21 20:35:51,024 INFO L185 CegarLoopUtils]: At program point L119(line 119) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 .cse3 .cse4))) [2021-02-21 20:35:51,025 INFO L185 CegarLoopUtils]: At program point L86-1(lines 35 132) the Hoare annotation is: (let ((.cse12 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse14 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse15 (= main_~lk8~0 1)) (.cse10 (= main_~p4~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~p1~0 0)) (.cse13 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse2 .cse4 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse15 .cse6 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse8 .cse9 .cse5 .cse15 .cse7 .cse11 .cse13) (and .cse8 .cse9 .cse5 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse6 .cse12 .cse13) (and .cse8 .cse14 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse2 .cse9 .cse10 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse3 .cse15 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse4 .cse5 .cse15 .cse6 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse9 .cse4 .cse15 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse15 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse1 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse14 .cse1 .cse2 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse9 .cse3 .cse5 .cse15 .cse12 .cse13) (and .cse1 .cse9 .cse3 .cse5 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse7 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse4 .cse10 .cse6 .cse12) (and .cse8 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse15 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse9 .cse3 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse7) (and .cse8 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse3 .cse4 .cse15 .cse6 .cse7) (and .cse8 .cse14 .cse9 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse0 .cse8 .cse4 .cse5 .cse15 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse12) (and .cse0 .cse14 .cse1 .cse3 .cse4 .cse15 .cse6 .cse12) (and .cse8 .cse3 .cse5 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse15 .cse7 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7) (and .cse8 .cse14 .cse2 .cse4 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse9 .cse3 .cse15 .cse10 .cse12 .cse13) (and .cse1 .cse3 .cse5 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse14 .cse1 .cse4 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse1 .cse4 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12 .cse13) (and .cse1 .cse9 .cse5 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse9 .cse5 .cse15 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse4 .cse15 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse4 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse12) (and .cse8 .cse14 .cse4 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse3 .cse5 .cse15 .cse10 .cse6 .cse7 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11) (and .cse8 .cse2 .cse5 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse10 .cse12) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse3 .cse5 .cse15 .cse10 .cse12 .cse13) (and .cse8 .cse4 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse12) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse10 .cse7) (and .cse0 .cse8 .cse14 .cse4 .cse15 .cse6 .cse7 .cse11) (and .cse8 .cse2 .cse9 .cse4 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse4 .cse5 .cse15 .cse6 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse3 .cse15 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse15 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse10 .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse8 .cse9 .cse5 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse2 .cse9 .cse3 .cse5 .cse10 .cse12 .cse13) (and .cse8 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse10 .cse12) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse5 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse15 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse2 .cse5 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse15 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse4 .cse15 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse3 .cse15 .cse6 .cse12 .cse13) (and .cse1 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse3 .cse5 .cse15 .cse6 .cse12 .cse13) (and .cse1 .cse9 .cse4 .cse5 .cse15 .cse10 .cse7 .cse11) (and .cse8 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse7 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse4 .cse15 .cse7 .cse11) (and .cse8 .cse14 .cse9 .cse4 .cse15 .cse10 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse4 .cse10 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse9 .cse3 .cse5 .cse15 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse7) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse14 .cse1 .cse2 .cse9 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse9 .cse15 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse1 .cse9 .cse5 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse15 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse8 .cse14 .cse2 .cse9 .cse4 .cse10 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse4 .cse15 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse12) (and .cse8 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse7) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse15 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse11) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse8 .cse2 .cse9 .cse5 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse4 .cse15 .cse10 .cse6 .cse12) (and .cse8 .cse2 .cse9 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse12) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse6 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse8 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse12) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse3 .cse4 .cse15 .cse10 .cse6 .cse7) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse7) (and .cse14 .cse1 .cse3 .cse4 .cse15 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse5 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse9 .cse4 .cse5 .cse15 .cse11 .cse12) (and .cse8 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse8 .cse9 .cse3 .cse5 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse8 .cse3 .cse5 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse3 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse14 .cse1 .cse2 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse7 .cse11) (and .cse8 .cse14 .cse3 .cse4 .cse15 .cse10 .cse6 .cse12) (and .cse14 .cse1 .cse2 .cse9 .cse4 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse14 .cse1 .cse9 .cse4 .cse15 .cse10 .cse7 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse4 .cse11 .cse12) (and .cse8 .cse14 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse10 .cse7 .cse13) (and .cse0 .cse8 .cse9 .cse4 .cse5 .cse15 .cse7 .cse11) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse15 .cse12 .cse13) (and .cse14 .cse1 .cse9 .cse4 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse14 .cse1 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse3 .cse5 .cse10 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse7 .cse11) (and .cse0 .cse1 .cse5 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse1 .cse9 .cse4 .cse5 .cse15 .cse10 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse10 .cse7 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse12) (and .cse14 .cse1 .cse4 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse5 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse3 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse4 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse2 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse4 .cse5 .cse15 .cse10 .cse7 .cse11) (and .cse8 .cse14 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse15 .cse11 .cse12) (and .cse8 .cse14 .cse4 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse1 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse2 .cse9 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse9 .cse4 .cse15 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse9 .cse15 .cse11 .cse12 .cse13) (and .cse8 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse12) (and .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse10 .cse7) (and .cse0 .cse8 .cse14 .cse3 .cse4 .cse15 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse5 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse9 .cse4 .cse5 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse9 .cse5 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse4 .cse15 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse10 .cse12) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse15 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse1 .cse9 .cse3 .cse5 .cse15 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse6 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse12) (and .cse0 .cse1 .cse9 .cse5 .cse15 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse9 .cse5 .cse15 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13) (and .cse8 .cse14 .cse2 .cse4 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse4 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse15 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse3 .cse4 .cse15 .cse6 .cse12) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse7) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse8 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse7 .cse11 .cse13) (and .cse8 .cse2 .cse9 .cse5 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse4 .cse15 .cse7 .cse11) (and .cse14 .cse1 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse12) (and .cse14 .cse1 .cse9 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse2 .cse5 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse4 .cse5 .cse15 .cse6 .cse7 .cse11) (and .cse8 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse3 .cse15 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse3 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse4 .cse7 .cse11) (and .cse1 .cse3 .cse5 .cse15 .cse10 .cse6 .cse7 .cse13))) [2021-02-21 20:35:51,026 INFO L192 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: true [2021-02-21 20:35:51,026 INFO L192 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: true [2021-02-21 20:35:51,026 INFO L192 CegarLoopUtils]: At program point L20-2(line 20) the Hoare annotation is: true [2021-02-21 20:35:51,026 INFO L185 CegarLoopUtils]: At program point L136(line 136) the Hoare annotation is: false [2021-02-21 20:35:51,027 INFO L185 CegarLoopUtils]: At program point L103(line 103) the Hoare annotation is: (let ((.cse10 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse7) (and .cse0 .cse6 .cse9 .cse10 .cse7 .cse3) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse8 .cse0 .cse6 .cse10 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse3 .cse5) (and .cse0 .cse6 .cse10 .cse7 .cse3 .cse4) (and .cse0 .cse9 .cse10 .cse2 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse7 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse10 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse10 .cse7) (and .cse8 .cse0 .cse1 .cse10 .cse2 .cse4) (and .cse8 .cse0 .cse10 .cse2 .cse7 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse2) (and .cse0 .cse6 .cse1 .cse9 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse10) (and .cse0 .cse6 .cse1 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse2 .cse7 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse4 .cse5))) [2021-02-21 20:35:51,027 INFO L192 CegarLoopUtils]: At program point L37(lines 37 39) the Hoare annotation is: true [2021-02-21 20:35:51,027 INFO L185 CegarLoopUtils]: At program point L70-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2021-02-21 20:35:51,028 INFO L185 CegarLoopUtils]: At program point L87(line 87) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse10 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2021-02-21 20:35:51,028 INFO L192 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: true [2021-02-21 20:35:51,028 INFO L192 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: true [2021-02-21 20:35:51,028 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2021-02-21 20:35:51,028 INFO L185 CegarLoopUtils]: At program point L104(line 104) the Hoare annotation is: (let ((.cse10 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse7) (and .cse0 .cse6 .cse9 .cse10 .cse7 .cse3) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse8 .cse0 .cse6 .cse10 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse3 .cse5) (and .cse0 .cse6 .cse10 .cse7 .cse3 .cse4) (and .cse0 .cse9 .cse10 .cse2 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse7 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse10 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse10 .cse7) (and .cse8 .cse0 .cse1 .cse10 .cse2 .cse4) (and .cse8 .cse0 .cse10 .cse2 .cse7 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse2) (and .cse0 .cse6 .cse1 .cse9 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse10) (and .cse0 .cse6 .cse1 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse2 .cse7 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse4 .cse5))) [2021-02-21 20:35:51,028 INFO L185 CegarLoopUtils]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2021-02-21 20:35:51,028 INFO L185 CegarLoopUtils]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2021-02-21 20:35:51,028 INFO L192 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: true [2021-02-21 20:35:51,029 INFO L192 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: true [2021-02-21 20:35:51,029 INFO L192 CegarLoopUtils]: At program point L23-2(line 23) the Hoare annotation is: true [2021-02-21 20:35:51,029 INFO L192 CegarLoopUtils]: At program point L40(line 40) the Hoare annotation is: true [2021-02-21 20:35:51,029 INFO L185 CegarLoopUtils]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1))) (or (and (= main_~p8~0 0) .cse0) (and (= main_~lk8~0 1) .cse0))) [2021-02-21 20:35:51,029 INFO L192 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: true [2021-02-21 20:35:51,029 INFO L185 CegarLoopUtils]: At program point L107-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse0 (= main_~p6~0 0)) (.cse7 (= main_~p8~0 0)) (.cse2 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse6) (and .cse1 .cse2 .cse4 .cse3) (and .cse0 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse4) (and .cse1 .cse4 .cse3 .cse6) (and .cse0 .cse7 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse6) (and .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse2) (and .cse0 .cse7 .cse1 .cse6) (and .cse7 .cse2 .cse4 .cse5) (and .cse2 .cse4 .cse3 .cse5) (and .cse0 .cse7 .cse2 .cse5))) [2021-02-21 20:35:51,029 INFO L185 CegarLoopUtils]: At program point L74-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2021-02-21 20:35:51,029 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-21 20:35:51,030 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-21 20:35:51,030 INFO L185 CegarLoopUtils]: At program point L124(line 124) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1))) (or (and (= main_~p8~0 0) .cse0) (and (= main_~lk8~0 1) .cse0))) [2021-02-21 20:35:51,030 INFO L192 CegarLoopUtils]: At program point L58(lines 58 60) the Hoare annotation is: true [2021-02-21 20:35:51,030 INFO L185 CegarLoopUtils]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-21 20:35:51,030 INFO L185 CegarLoopUtils]: At program point L108(line 108) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse1 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~p8~0 0)) (.cse2 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse0 .cse2 .cse8 .cse4 .cse7) (and .cse0 .cse5 .cse3 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse3 .cse8 .cse4 .cse6) (and .cse0 .cse5 .cse8 .cse6 .cse7) (and .cse0 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse5 .cse2 .cse8 .cse7))) [2021-02-21 20:35:51,030 INFO L185 CegarLoopUtils]: At program point L75(line 75) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2021-02-21 20:35:51,030 INFO L192 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: true [2021-02-21 20:35:51,030 INFO L192 CegarLoopUtils]: At program point L9(line 9) the Hoare annotation is: true [2021-02-21 20:35:51,030 INFO L192 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: true [2021-02-21 20:35:51,032 INFO L185 CegarLoopUtils]: At program point L92-1(lines 35 132) the Hoare annotation is: (let ((.cse11 (= main_~p5~0 0)) (.cse8 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse9 (= main_~p8~0 0)) (.cse13 (= main_~lk2~0 1)) (.cse12 (= main_~p7~0 0)) (.cse7 (= main_~lk3~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse10 (= main_~p4~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse12 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse11 .cse12 .cse2 .cse5) (and .cse0 .cse1 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse7 .cse9 .cse13 .cse12 .cse2 .cse10 .cse4) (and .cse8 .cse1 .cse9 .cse13 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse12 .cse5) (and .cse0 .cse1 .cse9 .cse11 .cse13 .cse2 .cse6) (and .cse1 .cse9 .cse11 .cse13 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse12 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse3 .cse6) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse11 .cse13 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse13 .cse12 .cse10 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse13 .cse3 .cse10 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse13 .cse10 .cse4 .cse6) (and .cse7 .cse9 .cse12 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse11 .cse13 .cse12 .cse2) (and .cse1 .cse9 .cse13 .cse12 .cse2 .cse10 .cse4) (and .cse0 .cse7 .cse9 .cse12 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse12 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse12 .cse5) (and .cse1 .cse13 .cse2 .cse3 .cse10 .cse4 .cse6) (and .cse7 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse12 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse11 .cse13 .cse12 .cse2) (and .cse7 .cse9 .cse13 .cse2 .cse10 .cse4 .cse6) (and .cse1 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse11 .cse13 .cse12 .cse3 .cse10) (and .cse0 .cse7 .cse9 .cse11 .cse2 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse11 .cse13 .cse12 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse13 .cse10 .cse6) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse12 .cse3 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse11 .cse13 .cse3 .cse6) (and .cse7 .cse11 .cse13 .cse2 .cse3 .cse10 .cse6) (and .cse1 .cse9 .cse11 .cse13 .cse12 .cse2 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse10 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse12 .cse4 .cse5) (and .cse0 .cse7 .cse12 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse13 .cse12 .cse4) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse6) (and .cse7 .cse11 .cse12 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse7 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse0 .cse7 .cse11 .cse12 .cse2 .cse3 .cse5) (and .cse7 .cse11 .cse13 .cse12 .cse2 .cse3 .cse10) (and .cse1 .cse13 .cse12 .cse2 .cse3 .cse10 .cse4) (and .cse7 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse1 .cse11 .cse13 .cse12 .cse2 .cse3 .cse10) (and .cse1 .cse12 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse13 .cse12 .cse3 .cse10) (and .cse8 .cse1 .cse9 .cse13 .cse12 .cse10 .cse4) (and .cse7 .cse9 .cse11 .cse12 .cse2 .cse10 .cse5) (and .cse7 .cse8 .cse13 .cse3 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse13 .cse12 .cse2 .cse3) (and .cse0 .cse7 .cse9 .cse11 .cse13 .cse2 .cse6) (and .cse8 .cse1 .cse11 .cse12 .cse3 .cse10 .cse5) (and .cse0 .cse7 .cse13 .cse12 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse12 .cse3) (and .cse0 .cse7 .cse8 .cse9 .cse12 .cse4 .cse5) (and .cse7 .cse9 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5 .cse6) (and .cse1 .cse9 .cse13 .cse2 .cse10 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse11 .cse12 .cse10 .cse5) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse12 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse11 .cse12 .cse3 .cse5) (and .cse0 .cse7 .cse8 .cse12 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse13 .cse12 .cse2 .cse4) (and .cse1 .cse11 .cse12 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse11 .cse12 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse11 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse11 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse11 .cse12 .cse2 .cse3 .cse5) (and .cse7 .cse8 .cse12 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse13 .cse12 .cse3 .cse4) (and .cse1 .cse9 .cse11 .cse12 .cse2 .cse10 .cse5) (and .cse0 .cse7 .cse9 .cse11 .cse12 .cse2 .cse5) (and .cse0 .cse7 .cse9 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse12 .cse3 .cse10 .cse4) (and .cse0 .cse8 .cse1 .cse11 .cse13 .cse12 .cse3) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse11 .cse12 .cse10 .cse5) (and .cse7 .cse9 .cse11 .cse13 .cse2 .cse10 .cse6) (and .cse0 .cse1 .cse9 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse0 .cse7 .cse8 .cse13 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse11 .cse13 .cse12 .cse2 .cse10) (and .cse1 .cse11 .cse13 .cse2 .cse3 .cse10 .cse6) (and .cse7 .cse13 .cse12 .cse2 .cse3 .cse10 .cse4) (and .cse0 .cse7 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse1 .cse12 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse13 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse13 .cse6) (and .cse7 .cse8 .cse11 .cse13 .cse3 .cse10 .cse6) (and .cse0 .cse1 .cse11 .cse13 .cse12 .cse2 .cse3) (and .cse0 .cse7 .cse9 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse9 .cse11 .cse2 .cse5 .cse6) (and .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse12 .cse2 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse13 .cse12 .cse4) (and .cse0 .cse1 .cse13 .cse12 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse13 .cse12 .cse3 .cse10 .cse4) (and .cse0 .cse8 .cse1 .cse13 .cse3 .cse4 .cse6) (and .cse1 .cse9 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse11 .cse13 .cse3 .cse10 .cse6) (and .cse1 .cse9 .cse12 .cse2 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse13 .cse4 .cse6) (and .cse0 .cse1 .cse9 .cse13 .cse12 .cse2 .cse4) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6))) [2021-02-21 20:35:51,032 INFO L192 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: true [2021-02-21 20:35:51,032 INFO L192 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: true [2021-02-21 20:35:51,033 INFO L192 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: true [2021-02-21 20:35:51,033 INFO L185 CegarLoopUtils]: At program point L109(line 109) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse1 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~p8~0 0)) (.cse2 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse0 .cse2 .cse8 .cse4 .cse7) (and .cse0 .cse5 .cse3 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse3 .cse8 .cse4 .cse6) (and .cse0 .cse5 .cse8 .cse6 .cse7) (and .cse0 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse5 .cse2 .cse8 .cse7))) [2021-02-21 20:35:51,036 INFO L185 CegarLoopUtils]: At program point L93(line 93) the Hoare annotation is: (let ((.cse8 (= main_~p6~0 0)) (.cse11 (= main_~p4~0 0)) (.cse13 (= main_~lk3~0 1)) (.cse14 (= main_~lk8~0 1)) (.cse12 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse10 (= main_~p7~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p5~0 0)) (.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~lk1~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse13 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse13 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse13 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse13 .cse8 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse1 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse1 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse13 .cse8 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse13 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse1 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse1 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse13 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7))) [2021-02-21 20:35:51,036 INFO L192 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: true [2021-02-21 20:35:51,036 INFO L192 CegarLoopUtils]: At program point L44(line 44) the Hoare annotation is: true [2021-02-21 20:35:51,036 INFO L192 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: true [2021-02-21 20:35:51,037 INFO L192 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: true [2021-02-21 20:35:51,037 INFO L192 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: true [2021-02-21 20:35:51,038 INFO L185 CegarLoopUtils]: At program point L94(line 94) the Hoare annotation is: (let ((.cse8 (= main_~p6~0 0)) (.cse11 (= main_~p4~0 0)) (.cse13 (= main_~lk3~0 1)) (.cse14 (= main_~lk8~0 1)) (.cse12 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse10 (= main_~p7~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p5~0 0)) (.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~lk1~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse13 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse13 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse13 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse13 .cse8 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse1 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse1 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse13 .cse8 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse13 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse1 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse1 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse13 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7))) [2021-02-21 20:35:51,038 INFO L192 CegarLoopUtils]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2021-02-21 20:35:51,038 INFO L185 CegarLoopUtils]: At program point L78-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2021-02-21 20:35:51,039 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-21 20:35:51,039 INFO L185 CegarLoopUtils]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2021-02-21 20:35:51,039 INFO L185 CegarLoopUtils]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2021-02-21 20:35:51,039 INFO L192 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: true [2021-02-21 20:35:51,040 INFO L185 CegarLoopUtils]: At program point L62-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2021-02-21 20:35:51,040 INFO L192 CegarLoopUtils]: At program point L29-1(line 29) the Hoare annotation is: true [2021-02-21 20:35:51,042 INFO L192 CegarLoopUtils]: At program point L29-2(line 29) the Hoare annotation is: true [2021-02-21 20:35:51,042 INFO L185 CegarLoopUtils]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2021-02-21 20:35:51,042 INFO L185 CegarLoopUtils]: At program point L112-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk8~0 1)) (.cse2 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3) (and .cse3 .cse4 .cse5) (and .cse0 .cse5 .cse2) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse4 .cse5 .cse2))) [2021-02-21 20:35:51,042 INFO L192 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: true [2021-02-21 20:35:51,042 INFO L185 CegarLoopUtils]: At program point L129(line 129) the Hoare annotation is: (= main_~lk8~0 1) [2021-02-21 20:35:51,043 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) the Hoare annotation is: false [2021-02-21 20:35:51,043 INFO L185 CegarLoopUtils]: At program point L63(line 63) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-21 20:35:51,043 INFO L192 CegarLoopUtils]: At program point L30(line 30) the Hoare annotation is: true [2021-02-21 20:35:51,044 INFO L192 CegarLoopUtils]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2021-02-21 20:35:51,044 INFO L185 CegarLoopUtils]: At program point L113(line 113) the Hoare annotation is: (let ((.cse3 (= main_~lk7~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse0 (= main_~lk6~0 1)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p8~0 0)) (.cse6 (= main_~p7~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse5 .cse6 .cse2))) [2021-02-21 20:35:51,044 INFO L192 CegarLoopUtils]: At program point L14(line 14) the Hoare annotation is: true [2021-02-21 20:35:51,044 INFO L192 CegarLoopUtils]: At program point L14-1(line 14) the Hoare annotation is: true [2021-02-21 20:35:51,045 INFO L192 CegarLoopUtils]: At program point L14-2(line 14) the Hoare annotation is: true [2021-02-21 20:35:51,045 INFO L185 CegarLoopUtils]: At program point L97-1(lines 35 132) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse9 (= main_~lk8~0 1)) (.cse3 (= main_~p4~0 0)) (.cse7 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse10 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse2 .cse9 .cse4) (and .cse6 .cse10 .cse7 .cse9 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse11 .cse2 .cse5) (and .cse10 .cse7 .cse11 .cse8 .cse9 .cse3) (and .cse7 .cse11 .cse8 .cse2 .cse9 .cse3) (and .cse10 .cse7 .cse11 .cse9 .cse3 .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse10 .cse7 .cse1 .cse11 .cse8 .cse3) (and .cse6 .cse10 .cse7 .cse11 .cse8 .cse9) (and .cse7 .cse1 .cse11 .cse8 .cse2 .cse3) (and .cse6 .cse10 .cse7 .cse1 .cse11 .cse8) (and .cse0 .cse11 .cse2 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse10 .cse11 .cse8 .cse9) (and .cse6 .cse0 .cse1 .cse8 .cse2 .cse4) (and .cse6 .cse0 .cse8 .cse2 .cse9 .cse4) (and .cse6 .cse7 .cse1 .cse8 .cse2 .cse4) (and .cse6 .cse0 .cse1 .cse11 .cse8 .cse2) (and .cse10 .cse7 .cse8 .cse9 .cse3 .cse4) (and .cse6 .cse10 .cse7 .cse11 .cse9 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse3 .cse5) (and .cse6 .cse0 .cse10 .cse1 .cse11 .cse5) (and .cse0 .cse1 .cse11 .cse8 .cse2 .cse3) (and .cse7 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse1 .cse11 .cse2 .cse5) (and .cse6 .cse10 .cse7 .cse8 .cse9 .cse4) (and .cse7 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse2 .cse9 .cse3 .cse4) (and .cse0 .cse10 .cse9 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse11 .cse8 .cse2 .cse9) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse10 .cse7 .cse9 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse9 .cse3) (and .cse6 .cse0 .cse10 .cse8 .cse9 .cse4) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse4) (and .cse6 .cse7 .cse1 .cse11 .cse8 .cse2) (and .cse10 .cse7 .cse1 .cse11 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse9 .cse4 .cse5) (and .cse6 .cse0 .cse10 .cse9 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse6 .cse10 .cse7 .cse1 .cse4 .cse5) (and .cse6 .cse0 .cse11 .cse2 .cse9 .cse5) (and .cse10 .cse7 .cse1 .cse8 .cse3 .cse4) (and .cse6 .cse7 .cse11 .cse8 .cse2 .cse9) (and .cse0 .cse10 .cse11 .cse9 .cse3 .cse5) (and .cse0 .cse10 .cse8 .cse9 .cse3 .cse4) (and .cse0 .cse11 .cse8 .cse2 .cse9 .cse3) (and .cse6 .cse0 .cse10 .cse1 .cse8 .cse4) (and .cse6 .cse0 .cse10 .cse11 .cse9 .cse5) (and .cse6 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse0 .cse10 .cse1 .cse11 .cse8) (and .cse6 .cse10 .cse7 .cse1 .cse8 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse3) (and .cse6 .cse7 .cse11 .cse2 .cse9 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse2 .cse9 .cse4 .cse5) (and .cse7 .cse11 .cse2 .cse9 .cse3 .cse5) (and .cse6 .cse10 .cse7 .cse1 .cse11 .cse5) (and .cse6 .cse0 .cse10 .cse1 .cse4 .cse5))) [2021-02-21 20:35:51,045 INFO L185 CegarLoopUtils]: At program point L114(line 114) the Hoare annotation is: (let ((.cse3 (= main_~lk7~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse0 (= main_~lk6~0 1)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p8~0 0)) (.cse6 (= main_~p7~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse5 .cse6 .cse2))) [2021-02-21 20:35:51,045 INFO L192 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: true [2021-02-21 20:35:51,046 INFO L192 CegarLoopUtils]: At program point L15(line 15) the Hoare annotation is: true [2021-02-21 20:35:51,046 INFO L185 CegarLoopUtils]: At program point L98(line 98) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p4~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse8 (= main_~p6~0 0)) (.cse12 (= main_~lk7~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse9 (= main_~p8~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse10 .cse8 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse2) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse8 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse11 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse4 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse8 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse10 .cse8 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse10 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse10 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse12) (and .cse11 .cse10 .cse8 .cse1 .cse4 .cse6 .cse12) (and .cse10 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse2) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse11 .cse10 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse12) (and .cse10 .cse8 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse10 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse1 .cse4 .cse6 .cse12) (and .cse8 .cse0 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse10 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse6))) [2021-02-21 20:35:51,047 INFO L185 CegarLoopUtils]: At program point L82-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2021-02-21 20:35:51,048 INFO L185 CegarLoopUtils]: At program point L99(line 99) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p4~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse8 (= main_~p6~0 0)) (.cse12 (= main_~lk7~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse9 (= main_~p8~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse10 .cse8 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse2) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse8 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse11 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse4 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse8 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse10 .cse8 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse10 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse10 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse12) (and .cse11 .cse10 .cse8 .cse1 .cse4 .cse6 .cse12) (and .cse10 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse2) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse11 .cse10 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse12) (and .cse10 .cse8 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse10 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse1 .cse4 .cse6 .cse12) (and .cse8 .cse0 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse10 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse6))) [2021-02-21 20:35:51,048 INFO L192 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-02-21 20:35:51,048 INFO L185 CegarLoopUtils]: At program point L66-1(lines 35 132) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2021-02-21 20:35:51,049 INFO L185 CegarLoopUtils]: At program point L83(line 83) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2021-02-21 20:35:51,049 INFO L192 CegarLoopUtils]: At program point L50(line 50) the Hoare annotation is: true [2021-02-21 20:35:51,049 INFO L192 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: true [2021-02-21 20:35:51,049 INFO L192 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: true [2021-02-21 20:35:51,049 INFO L192 CegarLoopUtils]: At program point L17-2(line 17) the Hoare annotation is: true [2021-02-21 20:35:51,050 INFO L192 CegarLoopUtils]: At program point L133(lines 7 137) the Hoare annotation is: true [2021-02-21 20:35:51,050 INFO L185 CegarLoopUtils]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2021-02-21 20:35:51,050 INFO L185 CegarLoopUtils]: At program point L117-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse2 .cse3))) [2021-02-21 20:35:51,050 INFO L192 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: true [2021-02-21 20:35:51,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 08:35:51 BoogieIcfgContainer [2021-02-21 20:35:51,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-21 20:35:51,072 INFO L168 Benchmark]: Toolchain (without parser) took 146536.14 ms. Allocated memory was 159.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 135.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2021-02-21 20:35:51,072 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 159.4 MB. Free memory is still 133.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 20:35:51,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.48 ms. Allocated memory is still 159.4 MB. Free memory was 134.4 MB in the beginning and 124.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-02-21 20:35:51,076 INFO L168 Benchmark]: Boogie Preprocessor took 46.17 ms. Allocated memory is still 159.4 MB. Free memory was 124.4 MB in the beginning and 122.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-21 20:35:51,077 INFO L168 Benchmark]: RCFGBuilder took 725.77 ms. Allocated memory is still 159.4 MB. Free memory was 122.7 MB in the beginning and 129.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-02-21 20:35:51,078 INFO L168 Benchmark]: TraceAbstraction took 145413.31 ms. Allocated memory was 159.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 129.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2021-02-21 20:35:51,089 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.21 ms. Allocated memory is still 159.4 MB. Free memory is still 133.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 321.48 ms. Allocated memory is still 159.4 MB. Free memory was 134.4 MB in the beginning and 124.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.17 ms. Allocated memory is still 159.4 MB. Free memory was 124.4 MB in the beginning and 122.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 725.77 ms. Allocated memory is still 159.4 MB. Free memory was 122.7 MB in the beginning and 129.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 145413.31 ms. Allocated memory was 159.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 129.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 135]: 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 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 125.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2472 SDtfs, 2910 SDslu, 244 SDs, 0 SdLazy, 1791 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5487occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 2805 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 107 LocationsWithAnnotation, 107 PreInvPairs, 10611 NumberOfFragments, 32399 HoareAnnotationTreeSize, 107 FomulaSimplifications, 4171023 FormulaSimplificationTreeSizeReduction, 25.7s HoareSimplificationTime, 107 FomulaSimplificationsInter, 47378 FormulaSimplificationTreeSizeReductionInter, 99.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...