/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.0-b8ad66e [2020-10-23 20:31:31,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:31:31,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:31:31,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:31:31,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:31:31,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:31:31,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:31:31,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:31:31,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:31:31,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:31:31,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:31:31,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:31:31,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:31:31,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:31:31,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:31:31,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:31:31,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:31:31,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:31:31,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:31:31,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:31:31,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:31:31,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:31:31,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:31:31,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:31:31,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:31:31,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:31:31,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:31:31,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:31:31,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:31:31,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:31:31,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:31:31,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:31:31,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:31:31,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:31:31,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:31:31,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:31:31,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:31:31,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:31:31,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:31:31,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:31:31,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:31:31,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:31:31,947 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:31:31,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:31:31,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:31:31,954 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:31:31,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:31:31,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:31:31,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:31:31,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:31:31,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:31:31,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:31:31,958 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:31:31,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:31:31,958 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:31:31,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:31:31,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:31:31,959 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:31:31,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:31:31,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:31:31,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:31:31,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:31:31,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:31:31,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:31:31,961 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 [2020-10-23 20:31:32,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:31:32,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:31:32,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:31:32,495 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:31:32,495 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:31:32,497 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-10-23 20:31:32,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3971c9d/dcaa1c44168a4d748509f283a73035fc/FLAG13d6c1843 [2020-10-23 20:31:33,198 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:31:33,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-10-23 20:31:33,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3971c9d/dcaa1c44168a4d748509f283a73035fc/FLAG13d6c1843 [2020-10-23 20:31:33,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3971c9d/dcaa1c44168a4d748509f283a73035fc [2020-10-23 20:31:33,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:31:33,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:31:33,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:31:33,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:31:33,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:31:33,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:31:33" (1/1) ... [2020-10-23 20:31:33,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595d64fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33, skipping insertion in model container [2020-10-23 20:31:33,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:31:33" (1/1) ... [2020-10-23 20:31:33,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:31:33,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:31:33,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:31:33,782 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:31:33,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:31:33,857 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:31:33,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33 WrapperNode [2020-10-23 20:31:33,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:31:33,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:31:33,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:31:33,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:31:33,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33" (1/1) ... [2020-10-23 20:31:33,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33" (1/1) ... [2020-10-23 20:31:33,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33" (1/1) ... [2020-10-23 20:31:33,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33" (1/1) ... [2020-10-23 20:31:33,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33" (1/1) ... [2020-10-23 20:31:33,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33" (1/1) ... [2020-10-23 20:31:33,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33" (1/1) ... [2020-10-23 20:31:33,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:31:33,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:31:33,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:31:33,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:31:33,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33" (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 [2020-10-23 20:31:34,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:31:34,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:31:34,047 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:31:34,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:31:34,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:31:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:31:34,048 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:31:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:31:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 20:31:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:31:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:31:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:31:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:31:34,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:31:34,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:31:34,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:31:34,926 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:31:34,927 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-23 20:31:34,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:31:34 BoogieIcfgContainer [2020-10-23 20:31:34,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:31:34,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:31:34,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:31:34,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:31:34,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:31:33" (1/3) ... [2020-10-23 20:31:34,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0032bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:31:34, skipping insertion in model container [2020-10-23 20:31:34,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:33" (2/3) ... [2020-10-23 20:31:34,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0032bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:31:34, skipping insertion in model container [2020-10-23 20:31:34,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:31:34" (3/3) ... [2020-10-23 20:31:34,939 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-10-23 20:31:34,951 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:31:34,956 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:31:34,970 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:31:34,995 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:31:34,996 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:31:34,996 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:31:34,996 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:31:34,996 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:31:34,996 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:31:34,997 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:31:34,997 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:31:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2020-10-23 20:31:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-23 20:31:35,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:35,032 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] [2020-10-23 20:31:35,032 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:35,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:35,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1694589771, now seen corresponding path program 1 times [2020-10-23 20:31:35,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:35,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [681575585] [2020-10-23 20:31:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:35,131 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:35,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:35,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [681575585] [2020-10-23 20:31:35,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:35,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:35,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551550828] [2020-10-23 20:31:35,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:35,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:35,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:35,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:35,493 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2020-10-23 20:31:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:36,192 INFO L93 Difference]: Finished difference Result 225 states and 305 transitions. [2020-10-23 20:31:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:36,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-10-23 20:31:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:36,207 INFO L225 Difference]: With dead ends: 225 [2020-10-23 20:31:36,208 INFO L226 Difference]: Without dead ends: 152 [2020-10-23 20:31:36,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-23 20:31:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2020-10-23 20:31:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-10-23 20:31:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2020-10-23 20:31:36,302 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 70 [2020-10-23 20:31:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:36,303 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2020-10-23 20:31:36,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2020-10-23 20:31:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-23 20:31:36,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:36,306 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] [2020-10-23 20:31:36,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:31:36,306 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1874187364, now seen corresponding path program 1 times [2020-10-23 20:31:36,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:36,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360665761] [2020-10-23 20:31:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:36,311 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:36,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:36,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360665761] [2020-10-23 20:31:36,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:36,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:36,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189778527] [2020-10-23 20:31:36,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:36,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:36,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:36,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:36,441 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand 4 states. [2020-10-23 20:31:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:36,836 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2020-10-23 20:31:36,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:36,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-10-23 20:31:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:36,840 INFO L225 Difference]: With dead ends: 182 [2020-10-23 20:31:36,840 INFO L226 Difference]: Without dead ends: 179 [2020-10-23 20:31:36,841 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 [2020-10-23 20:31:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-23 20:31:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2020-10-23 20:31:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-10-23 20:31:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2020-10-23 20:31:36,880 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 71 [2020-10-23 20:31:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:36,880 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2020-10-23 20:31:36,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2020-10-23 20:31:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-23 20:31:36,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:36,884 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] [2020-10-23 20:31:36,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:31:36,884 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:36,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:36,885 INFO L82 PathProgramCache]: Analyzing trace with hash -985099166, now seen corresponding path program 1 times [2020-10-23 20:31:36,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:36,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1018351980] [2020-10-23 20:31:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:36,889 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:36,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:37,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1018351980] [2020-10-23 20:31:37,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:37,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:37,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974437419] [2020-10-23 20:31:37,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:37,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:37,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:37,015 INFO L87 Difference]: Start difference. First operand 151 states and 194 transitions. Second operand 4 states. [2020-10-23 20:31:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:37,341 INFO L93 Difference]: Finished difference Result 355 states and 483 transitions. [2020-10-23 20:31:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:37,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-10-23 20:31:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:37,344 INFO L225 Difference]: With dead ends: 355 [2020-10-23 20:31:37,344 INFO L226 Difference]: Without dead ends: 249 [2020-10-23 20:31:37,346 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 [2020-10-23 20:31:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-10-23 20:31:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2020-10-23 20:31:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-23 20:31:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 329 transitions. [2020-10-23 20:31:37,394 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 329 transitions. Word has length 71 [2020-10-23 20:31:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:37,394 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 329 transitions. [2020-10-23 20:31:37,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 329 transitions. [2020-10-23 20:31:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-23 20:31:37,397 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:37,397 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] [2020-10-23 20:31:37,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:31:37,397 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:37,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:37,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1497949312, now seen corresponding path program 1 times [2020-10-23 20:31:37,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:37,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2018830286] [2020-10-23 20:31:37,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:37,401 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:37,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:37,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2018830286] [2020-10-23 20:31:37,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:37,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:37,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909801990] [2020-10-23 20:31:37,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:37,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:37,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:37,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:37,502 INFO L87 Difference]: Start difference. First operand 248 states and 329 transitions. Second operand 4 states. [2020-10-23 20:31:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:37,820 INFO L93 Difference]: Finished difference Result 302 states and 406 transitions. [2020-10-23 20:31:37,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:37,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-10-23 20:31:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:37,823 INFO L225 Difference]: With dead ends: 302 [2020-10-23 20:31:37,823 INFO L226 Difference]: Without dead ends: 299 [2020-10-23 20:31:37,824 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 [2020-10-23 20:31:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-10-23 20:31:37,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 248. [2020-10-23 20:31:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-23 20:31:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 327 transitions. [2020-10-23 20:31:37,867 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 327 transitions. Word has length 72 [2020-10-23 20:31:37,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:37,868 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 327 transitions. [2020-10-23 20:31:37,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 327 transitions. [2020-10-23 20:31:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-23 20:31:37,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:37,870 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] [2020-10-23 20:31:37,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:31:37,870 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:37,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash -465715359, now seen corresponding path program 1 times [2020-10-23 20:31:37,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:37,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1762504567] [2020-10-23 20:31:37,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:37,874 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:37,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:37,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1762504567] [2020-10-23 20:31:37,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:37,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:37,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990097826] [2020-10-23 20:31:37,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:37,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:37,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:37,960 INFO L87 Difference]: Start difference. First operand 248 states and 327 transitions. Second operand 4 states. [2020-10-23 20:31:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:38,325 INFO L93 Difference]: Finished difference Result 640 states and 874 transitions. [2020-10-23 20:31:38,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:38,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-10-23 20:31:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:38,329 INFO L225 Difference]: With dead ends: 640 [2020-10-23 20:31:38,329 INFO L226 Difference]: Without dead ends: 437 [2020-10-23 20:31:38,331 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 [2020-10-23 20:31:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-10-23 20:31:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2020-10-23 20:31:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-10-23 20:31:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 583 transitions. [2020-10-23 20:31:38,400 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 583 transitions. Word has length 72 [2020-10-23 20:31:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:38,401 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 583 transitions. [2020-10-23 20:31:38,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 583 transitions. [2020-10-23 20:31:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-23 20:31:38,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:38,403 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] [2020-10-23 20:31:38,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:31:38,403 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1575507240, now seen corresponding path program 1 times [2020-10-23 20:31:38,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:38,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462907822] [2020-10-23 20:31:38,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:38,407 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:38,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:38,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462907822] [2020-10-23 20:31:38,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:38,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:38,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559789845] [2020-10-23 20:31:38,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:38,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:38,490 INFO L87 Difference]: Start difference. First operand 436 states and 583 transitions. Second operand 4 states. [2020-10-23 20:31:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:38,864 INFO L93 Difference]: Finished difference Result 532 states and 718 transitions. [2020-10-23 20:31:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:38,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-10-23 20:31:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:38,868 INFO L225 Difference]: With dead ends: 532 [2020-10-23 20:31:38,868 INFO L226 Difference]: Without dead ends: 529 [2020-10-23 20:31:38,869 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 [2020-10-23 20:31:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-23 20:31:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 436. [2020-10-23 20:31:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-10-23 20:31:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 579 transitions. [2020-10-23 20:31:38,944 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 579 transitions. Word has length 73 [2020-10-23 20:31:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:38,945 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 579 transitions. [2020-10-23 20:31:38,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 579 transitions. [2020-10-23 20:31:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-23 20:31:38,946 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:38,947 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] [2020-10-23 20:31:38,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:31:38,947 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:38,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1544674994, now seen corresponding path program 1 times [2020-10-23 20:31:38,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:38,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [710325258] [2020-10-23 20:31:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:38,951 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:39,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:39,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [710325258] [2020-10-23 20:31:39,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:39,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:39,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504548827] [2020-10-23 20:31:39,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:39,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:39,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:39,067 INFO L87 Difference]: Start difference. First operand 436 states and 579 transitions. Second operand 4 states. [2020-10-23 20:31:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:39,482 INFO L93 Difference]: Finished difference Result 1192 states and 1614 transitions. [2020-10-23 20:31:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:39,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-10-23 20:31:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:39,487 INFO L225 Difference]: With dead ends: 1192 [2020-10-23 20:31:39,487 INFO L226 Difference]: Without dead ends: 801 [2020-10-23 20:31:39,489 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 [2020-10-23 20:31:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-10-23 20:31:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 800. [2020-10-23 20:31:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-10-23 20:31:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1063 transitions. [2020-10-23 20:31:39,624 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1063 transitions. Word has length 73 [2020-10-23 20:31:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:39,625 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1063 transitions. [2020-10-23 20:31:39,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1063 transitions. [2020-10-23 20:31:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-23 20:31:39,626 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:39,626 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] [2020-10-23 20:31:39,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:31:39,627 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1931575924, now seen corresponding path program 1 times [2020-10-23 20:31:39,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:39,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864487471] [2020-10-23 20:31:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:39,630 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:39,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:39,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864487471] [2020-10-23 20:31:39,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:39,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:39,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697129203] [2020-10-23 20:31:39,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:39,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:39,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:39,706 INFO L87 Difference]: Start difference. First operand 800 states and 1063 transitions. Second operand 4 states. [2020-10-23 20:31:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:40,211 INFO L93 Difference]: Finished difference Result 972 states and 1298 transitions. [2020-10-23 20:31:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:40,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-10-23 20:31:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:40,224 INFO L225 Difference]: With dead ends: 972 [2020-10-23 20:31:40,224 INFO L226 Difference]: Without dead ends: 969 [2020-10-23 20:31:40,228 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 [2020-10-23 20:31:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-10-23 20:31:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 800. [2020-10-23 20:31:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-10-23 20:31:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1055 transitions. [2020-10-23 20:31:40,417 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1055 transitions. Word has length 74 [2020-10-23 20:31:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:40,419 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1055 transitions. [2020-10-23 20:31:40,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1055 transitions. [2020-10-23 20:31:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-23 20:31:40,420 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:40,420 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] [2020-10-23 20:31:40,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:31:40,421 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash -632673779, now seen corresponding path program 1 times [2020-10-23 20:31:40,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:40,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136343748] [2020-10-23 20:31:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:40,425 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:40,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:40,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136343748] [2020-10-23 20:31:40,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:40,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:40,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773862504] [2020-10-23 20:31:40,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:40,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:40,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:40,523 INFO L87 Difference]: Start difference. First operand 800 states and 1055 transitions. Second operand 4 states. [2020-10-23 20:31:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:41,042 INFO L93 Difference]: Finished difference Result 2260 states and 3010 transitions. [2020-10-23 20:31:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:41,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-10-23 20:31:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:41,050 INFO L225 Difference]: With dead ends: 2260 [2020-10-23 20:31:41,050 INFO L226 Difference]: Without dead ends: 1505 [2020-10-23 20:31:41,053 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 [2020-10-23 20:31:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2020-10-23 20:31:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1504. [2020-10-23 20:31:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2020-10-23 20:31:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1967 transitions. [2020-10-23 20:31:41,320 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1967 transitions. Word has length 74 [2020-10-23 20:31:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:41,320 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1967 transitions. [2020-10-23 20:31:41,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1967 transitions. [2020-10-23 20:31:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-23 20:31:41,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:41,323 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] [2020-10-23 20:31:41,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:31:41,323 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:41,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:41,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1018007220, now seen corresponding path program 1 times [2020-10-23 20:31:41,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:41,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1518751619] [2020-10-23 20:31:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:41,326 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:41,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:41,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1518751619] [2020-10-23 20:31:41,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:41,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:41,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592208383] [2020-10-23 20:31:41,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:41,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:41,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:41,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:41,387 INFO L87 Difference]: Start difference. First operand 1504 states and 1967 transitions. Second operand 4 states. [2020-10-23 20:31:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:41,918 INFO L93 Difference]: Finished difference Result 1812 states and 2370 transitions. [2020-10-23 20:31:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:41,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-10-23 20:31:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:41,928 INFO L225 Difference]: With dead ends: 1812 [2020-10-23 20:31:41,928 INFO L226 Difference]: Without dead ends: 1809 [2020-10-23 20:31:41,929 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 [2020-10-23 20:31:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2020-10-23 20:31:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1504. [2020-10-23 20:31:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2020-10-23 20:31:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1951 transitions. [2020-10-23 20:31:42,147 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1951 transitions. Word has length 75 [2020-10-23 20:31:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:42,148 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1951 transitions. [2020-10-23 20:31:42,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1951 transitions. [2020-10-23 20:31:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-23 20:31:42,150 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:42,150 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] [2020-10-23 20:31:42,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:31:42,150 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:42,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:42,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1869571642, now seen corresponding path program 1 times [2020-10-23 20:31:42,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:42,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990626318] [2020-10-23 20:31:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:42,153 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:42,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:42,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990626318] [2020-10-23 20:31:42,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:42,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:42,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34747110] [2020-10-23 20:31:42,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:42,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:42,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:42,213 INFO L87 Difference]: Start difference. First operand 1504 states and 1951 transitions. Second operand 4 states. [2020-10-23 20:31:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:42,856 INFO L93 Difference]: Finished difference Result 4324 states and 5634 transitions. [2020-10-23 20:31:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:42,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-10-23 20:31:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:42,871 INFO L225 Difference]: With dead ends: 4324 [2020-10-23 20:31:42,871 INFO L226 Difference]: Without dead ends: 2865 [2020-10-23 20:31:42,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 [2020-10-23 20:31:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-10-23 20:31:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2864. [2020-10-23 20:31:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2864 states. [2020-10-23 20:31:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 3663 transitions. [2020-10-23 20:31:43,290 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 3663 transitions. Word has length 75 [2020-10-23 20:31:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:43,291 INFO L481 AbstractCegarLoop]: Abstraction has 2864 states and 3663 transitions. [2020-10-23 20:31:43,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 3663 transitions. [2020-10-23 20:31:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-23 20:31:43,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:43,294 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] [2020-10-23 20:31:43,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:31:43,294 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2129779897, now seen corresponding path program 1 times [2020-10-23 20:31:43,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:43,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1023610358] [2020-10-23 20:31:43,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:43,297 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:43,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:43,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1023610358] [2020-10-23 20:31:43,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:43,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:43,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297114036] [2020-10-23 20:31:43,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:43,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:43,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:43,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:43,391 INFO L87 Difference]: Start difference. First operand 2864 states and 3663 transitions. Second operand 4 states. [2020-10-23 20:31:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:44,747 INFO L93 Difference]: Finished difference Result 8308 states and 10642 transitions. [2020-10-23 20:31:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:44,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-23 20:31:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:44,775 INFO L225 Difference]: With dead ends: 8308 [2020-10-23 20:31:44,776 INFO L226 Difference]: Without dead ends: 5489 [2020-10-23 20:31:44,788 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 [2020-10-23 20:31:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2020-10-23 20:31:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5488. [2020-10-23 20:31:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-10-23 20:31:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6895 transitions. [2020-10-23 20:31:45,610 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6895 transitions. Word has length 76 [2020-10-23 20:31:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:45,610 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6895 transitions. [2020-10-23 20:31:45,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6895 transitions. [2020-10-23 20:31:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-23 20:31:45,614 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:45,614 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] [2020-10-23 20:31:45,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:31:45,615 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:45,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2034184296, now seen corresponding path program 1 times [2020-10-23 20:31:45,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:45,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578467858] [2020-10-23 20:31:45,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:45,618 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:45,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:45,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578467858] [2020-10-23 20:31:45,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:45,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:45,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474662712] [2020-10-23 20:31:45,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:45,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:45,683 INFO L87 Difference]: Start difference. First operand 5488 states and 6895 transitions. Second operand 4 states. [2020-10-23 20:31:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:47,165 INFO L93 Difference]: Finished difference Result 6516 states and 8114 transitions. [2020-10-23 20:31:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:47,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-23 20:31:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:47,197 INFO L225 Difference]: With dead ends: 6516 [2020-10-23 20:31:47,197 INFO L226 Difference]: Without dead ends: 6513 [2020-10-23 20:31:47,200 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 [2020-10-23 20:31:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2020-10-23 20:31:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 5488. [2020-10-23 20:31:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-10-23 20:31:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6831 transitions. [2020-10-23 20:31:47,834 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6831 transitions. Word has length 76 [2020-10-23 20:31:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:47,834 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6831 transitions. [2020-10-23 20:31:47,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6831 transitions. [2020-10-23 20:31:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-23 20:31:47,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:47,839 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] [2020-10-23 20:31:47,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:31:47,839 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2132138048, now seen corresponding path program 1 times [2020-10-23 20:31:47,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:47,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347978528] [2020-10-23 20:31:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:47,842 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:47,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:47,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347978528] [2020-10-23 20:31:47,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:47,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:47,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085768435] [2020-10-23 20:31:47,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:47,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:47,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:47,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:47,915 INFO L87 Difference]: Start difference. First operand 5488 states and 6831 transitions. Second operand 4 states. [2020-10-23 20:31:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:49,150 INFO L93 Difference]: Finished difference Result 6452 states and 7922 transitions. [2020-10-23 20:31:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:49,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-10-23 20:31:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:49,181 INFO L225 Difference]: With dead ends: 6452 [2020-10-23 20:31:49,182 INFO L226 Difference]: Without dead ends: 6449 [2020-10-23 20:31:49,186 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 [2020-10-23 20:31:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6449 states. [2020-10-23 20:31:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6449 to 5488. [2020-10-23 20:31:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-10-23 20:31:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6767 transitions. [2020-10-23 20:31:50,047 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6767 transitions. Word has length 77 [2020-10-23 20:31:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:50,047 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6767 transitions. [2020-10-23 20:31:50,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6767 transitions. [2020-10-23 20:31:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-23 20:31:50,052 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:50,052 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] [2020-10-23 20:31:50,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:31:50,053 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:50,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1606312742, now seen corresponding path program 1 times [2020-10-23 20:31:50,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:50,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150316243] [2020-10-23 20:31:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:50,056 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:50,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:50,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150316243] [2020-10-23 20:31:50,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:50,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:50,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966335665] [2020-10-23 20:31:50,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:50,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:50,124 INFO L87 Difference]: Start difference. First operand 5488 states and 6767 transitions. Second operand 4 states. [2020-10-23 20:31:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:51,587 INFO L93 Difference]: Finished difference Result 15987 states and 19697 transitions. [2020-10-23 20:31:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:51,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-10-23 20:31:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:51,607 INFO L225 Difference]: With dead ends: 15987 [2020-10-23 20:31:51,607 INFO L226 Difference]: Without dead ends: 5488 [2020-10-23 20:31:51,628 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 [2020-10-23 20:31:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2020-10-23 20:31:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5488. [2020-10-23 20:31:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-10-23 20:31:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6511 transitions. [2020-10-23 20:31:52,170 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6511 transitions. Word has length 77 [2020-10-23 20:31:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:52,171 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6511 transitions. [2020-10-23 20:31:52,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6511 transitions. [2020-10-23 20:31:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-23 20:31:52,175 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:52,176 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, 1] [2020-10-23 20:31:52,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:31:52,176 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1855843932, now seen corresponding path program 1 times [2020-10-23 20:31:52,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:52,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [324787911] [2020-10-23 20:31:52,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:52,179 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:52,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:52,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [324787911] [2020-10-23 20:31:52,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:52,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:52,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394140485] [2020-10-23 20:31:52,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:52,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:52,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:52,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:52,228 INFO L87 Difference]: Start difference. First operand 5488 states and 6511 transitions. Second operand 4 states. [2020-10-23 20:31:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:53,176 INFO L93 Difference]: Finished difference Result 5488 states and 6511 transitions. [2020-10-23 20:31:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:53,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-10-23 20:31:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:53,177 INFO L225 Difference]: With dead ends: 5488 [2020-10-23 20:31:53,177 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:31:53,190 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 [2020-10-23 20:31:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:31:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:31:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:31:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:31:53,191 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2020-10-23 20:31:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:53,191 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:31:53,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:31:53,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:31:53,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:31:53,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:31:55,808 WARN L193 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-23 20:31:56,075 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 39 [2020-10-23 20:31:57,686 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-23 20:31:59,135 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-23 20:31:59,238 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 31 [2020-10-23 20:31:59,470 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 85 [2020-10-23 20:31:59,866 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 41 [2020-10-23 20:32:00,010 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 53 [2020-10-23 20:32:01,070 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 783 DAG size of output: 31 [2020-10-23 20:32:01,255 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2020-10-23 20:32:01,448 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 85 [2020-10-23 20:32:01,739 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 499 DAG size of output: 31 [2020-10-23 20:32:02,007 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 65 [2020-10-23 20:32:02,154 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 47 [2020-10-23 20:32:02,547 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 668 DAG size of output: 34 [2020-10-23 20:32:03,053 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 189 [2020-10-23 20:32:03,387 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-10-23 20:32:03,569 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2020-10-23 20:32:04,459 WARN L193 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 769 DAG size of output: 31 [2020-10-23 20:32:04,795 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 53 [2020-10-23 20:32:05,087 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 41 [2020-10-23 20:32:05,231 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 31 [2020-10-23 20:32:05,501 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-10-23 20:32:05,666 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2020-10-23 20:32:07,057 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-23 20:32:07,783 WARN L193 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 606 DAG size of output: 45 [2020-10-23 20:32:08,159 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 668 DAG size of output: 34 [2020-10-23 20:32:08,313 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 65 [2020-10-23 20:32:09,493 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-23 20:32:10,310 WARN L193 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 743 DAG size of output: 31 [2020-10-23 20:32:10,870 WARN L193 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 189 [2020-10-23 20:32:10,975 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2020-10-23 20:32:11,380 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 121 [2020-10-23 20:32:12,771 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 798 DAG size of output: 39 [2020-10-23 20:32:13,910 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 791 DAG size of output: 31 [2020-10-23 20:32:14,831 WARN L193 SmtUtils]: Spent 919.00 ms on a formula simplification that was a NOOP. DAG size: 321 [2020-10-23 20:32:15,137 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 121 [2020-10-23 20:32:15,463 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 47 [2020-10-23 20:32:16,081 WARN L193 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 693 DAG size of output: 31 [2020-10-23 20:32:16,235 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2020-10-23 20:32:16,524 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-10-23 20:32:17,710 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-23 20:32:19,176 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:32:19,484 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-23 20:32:19,820 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:32:23,468 WARN L193 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-23 20:32:24,765 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:32:25,349 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:32:25,484 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-23 20:32:34,078 WARN L193 SmtUtils]: Spent 8.57 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-10-23 20:32:34,338 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:32:43,622 WARN L193 SmtUtils]: Spent 9.28 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2020-10-23 20:32:45,143 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-23 20:32:46,530 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:32:46,788 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:32:55,454 WARN L193 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-10-23 20:32:59,068 WARN L193 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-23 20:32:59,694 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-23 20:32:59,819 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-23 20:32:59,934 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-23 20:33:00,543 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:33:09,084 WARN L193 SmtUtils]: Spent 8.53 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-10-23 20:33:10,540 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-23 20:33:10,831 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-23 20:33:14,230 WARN L193 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-23 20:33:14,348 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-23 20:33:38,842 WARN L193 SmtUtils]: Spent 24.42 s on a formula simplification. DAG size of input: 311 DAG size of output: 291 [2020-10-23 20:33:42,001 WARN L193 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-23 20:33:42,548 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:33:43,214 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-23 20:33:43,355 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-23 20:33:46,720 WARN L193 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-23 20:33:56,206 WARN L193 SmtUtils]: Spent 9.48 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2020-10-23 20:33:56,215 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,215 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,215 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,216 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,216 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,216 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,216 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:33:56,216 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,217 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:33:56,217 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,217 INFO L270 CegarLoopResult]: 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|)) [2020-10-23 20:33:56,217 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,217 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-23 20:33:56,217 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:33:56,218 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:33:56,218 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:33:56,218 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:33:56,218 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:33:56,219 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,219 INFO L277 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-10-23 20:33:56,219 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2020-10-23 20:33:56,220 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,220 INFO L277 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-10-23 20:33:56,220 INFO L277 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-10-23 20:33:56,220 INFO L277 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-10-23 20:33:56,220 INFO L277 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-10-23 20:33:56,220 INFO L277 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-10-23 20:33:56,220 INFO L270 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: false [2020-10-23 20:33:56,221 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,221 INFO L277 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-10-23 20:33:56,221 INFO L277 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: true [2020-10-23 20:33:56,221 INFO L277 CegarLoopResult]: At program point L36-2(line 36) the Hoare annotation is: true [2020-10-23 20:33:56,222 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,222 INFO L277 CegarLoopResult]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2020-10-23 20:33:56,222 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,224 INFO L270 CegarLoopResult]: 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 .cse0 .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse7) (and .cse14 .cse1 .cse9 .cse3 .cse15 .cse10 .cse7 .cse13) (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))) [2020-10-23 20:33:56,224 INFO L277 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-10-23 20:33:56,224 INFO L277 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-10-23 20:33:56,224 INFO L277 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-10-23 20:33:56,225 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,225 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-23 20:33:56,225 INFO L270 CegarLoopResult]: At program point L136(line 136) the Hoare annotation is: false [2020-10-23 20:33:56,225 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,225 INFO L277 CegarLoopResult]: At program point L37(lines 37 39) the Hoare annotation is: true [2020-10-23 20:33:56,225 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,225 INFO L270 CegarLoopResult]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2020-10-23 20:33:56,226 INFO L270 CegarLoopResult]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2020-10-23 20:33:56,226 INFO L277 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-10-23 20:33:56,226 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,226 INFO L277 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-10-23 20:33:56,226 INFO L277 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: true [2020-10-23 20:33:56,227 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,227 INFO L277 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-10-23 20:33:56,227 INFO L277 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-10-23 20:33:56,228 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,228 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,228 INFO L277 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-10-23 20:33:56,228 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2020-10-23 20:33:56,228 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,229 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,229 INFO L270 CegarLoopResult]: At program point L129(line 129) the Hoare annotation is: (= main_~lk8~0 1) [2020-10-23 20:33:56,229 INFO L270 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-23 20:33:56,229 INFO L277 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-10-23 20:33:56,229 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2020-10-23 20:33:56,229 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,229 INFO L277 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-10-23 20:33:56,230 INFO L277 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-10-23 20:33:56,230 INFO L277 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-10-23 20:33:56,230 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,230 INFO L270 CegarLoopResult]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2020-10-23 20:33:56,231 INFO L277 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-10-23 20:33:56,231 INFO L277 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-10-23 20:33:56,231 INFO L277 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-10-23 20:33:56,231 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,231 INFO L277 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-10-23 20:33:56,231 INFO L277 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-10-23 20:33:56,231 INFO L277 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-10-23 20:33:56,232 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,232 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,232 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-23 20:33:56,233 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,234 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,234 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,234 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-23 20:33:56,234 INFO L277 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-10-23 20:33:56,235 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,235 INFO L277 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-10-23 20:33:56,235 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,235 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,235 INFO L277 CegarLoopResult]: At program point L58(lines 58 60) the Hoare annotation is: true [2020-10-23 20:33:56,235 INFO L270 CegarLoopResult]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-23 20:33:56,236 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,236 INFO L277 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-10-23 20:33:56,236 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-23 20:33:56,236 INFO L277 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-10-23 20:33:56,236 INFO L277 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-10-23 20:33:56,237 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,237 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,237 INFO L277 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-10-23 20:33:56,237 INFO L277 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-10-23 20:33:56,237 INFO L277 CegarLoopResult]: At program point L133(lines 7 137) the Hoare annotation is: true [2020-10-23 20:33:56,237 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,237 INFO L277 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: true [2020-10-23 20:33:56,238 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,239 INFO L277 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-10-23 20:33:56,239 INFO L277 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-10-23 20:33:56,239 INFO L277 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-10-23 20:33:56,239 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,239 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-23 20:33:56,239 INFO L270 CegarLoopResult]: 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))) [2020-10-23 20:33:56,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:33:56 BoogieIcfgContainer [2020-10-23 20:33:56,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:33:56,253 INFO L168 Benchmark]: Toolchain (without parser) took 142686.18 ms. Allocated memory was 151.0 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 127.3 MB in the beginning and 836.1 MB in the end (delta: -708.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. [2020-10-23 20:33:56,254 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:33:56,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.79 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 116.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:33:56,255 INFO L168 Benchmark]: Boogie Preprocessor took 85.76 ms. Allocated memory is still 151.0 MB. Free memory was 116.8 MB in the beginning and 115.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-23 20:33:56,255 INFO L168 Benchmark]: RCFGBuilder took 982.20 ms. Allocated memory is still 151.0 MB. Free memory was 115.0 MB in the beginning and 128.6 MB in the end (delta: -13.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:33:56,256 INFO L168 Benchmark]: TraceAbstraction took 141320.50 ms. Allocated memory was 151.0 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 128.0 MB in the beginning and 836.1 MB in the end (delta: -708.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. [2020-10-23 20:33:56,258 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.25 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 285.79 ms. Allocated memory is still 151.0 MB. Free memory was 126.7 MB in the beginning and 116.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 85.76 ms. Allocated memory is still 151.0 MB. Free memory was 116.8 MB in the beginning and 115.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 982.20 ms. Allocated memory is still 151.0 MB. Free memory was 115.0 MB in the beginning and 128.6 MB in the end (delta: -13.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 141320.50 ms. Allocated memory was 151.0 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 128.0 MB in the beginning and 836.1 MB in the end (delta: -708.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() 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: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 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: 18.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 123.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2488 SDtfs, 2889 SDslu, 271 SDs, 0 SdLazy, 1790 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5488occurred 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: 4.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 2639 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 110 LocationsWithAnnotation, 170 PreInvPairs, 10674 NumberOfFragments, 32402 HoareAnnotationTreeSize, 170 FomulaSimplifications, 4159407 FormulaSimplificationTreeSizeReduction, 24.4s HoareSimplificationTime, 110 FomulaSimplificationsInter, 47378 FormulaSimplificationTreeSizeReductionInter, 98.4s 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...